Relevant bibliographies by topics / Best Effort

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Best Effort'

Author: Grafiati
Published: 4 June 2021
Last updated: 10 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Best Effort.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Best Effort"

1

Goergen, N., W. S. Lin, K. J. R. Liu, and T. C. Clancy. "Best-Effort Cooperative Relaying." IEEE Transactions on Wireless Communications 10, no. 6 (June 2011): 1833–43. http://dx.doi.org/10.1109/twc.2011.051211.100683.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Carlberg, Ken, Panos Gevros, and Jon Crowcroft. "Lower than best effort." ACM SIGCOMM Computer Communication Review 31, no. 2 supplement (April 2001): 244–65. http://dx.doi.org/10.1145/844193.844208.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Breslau, Lee, and Scott Shenker. "Best-effort versus reservations." ACM SIGCOMM Computer Communication Review 28, no. 4 (October 1998): 3–16. http://dx.doi.org/10.1145/285243.285248.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bernstein, Sondra. "“HUSHED CRISIS” BEST DOCUMENTARY EFFORT." Juvenile Court Judges Journal 22, no. 1 (March 18, 2009): 21. http://dx.doi.org/10.1111/j.1755-6988.1971.tb00423.x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wydrowski, B., and M. Zukerman. "QoS in best-effort networks." IEEE Communications Magazine 40, no. 12 (December 2002): 44–49. http://dx.doi.org/10.1109/mcom.2002.1106158.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Diot, C., and J. Le Boudec. "Control of best effort traffic." IEEE Network 15, no. 3 (May 2001): 14–15. http://dx.doi.org/10.1109/mnet.2001.923936.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Plasser, E., T. Ziegler, P. Reichl, and G. Mittenecker. "Internet services beyond best effort." e & i Elektrotechnik und Informationstechnik 119, no. 2 (February 2002): 30–36. http://dx.doi.org/10.1007/bf03161578.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Dong In Kim. "Selective relative best scheduling for best-effort downlink packet data." IEEE Transactions on Wireless Communications 5, no. 6 (June 2006): 1254–59. http://dx.doi.org/10.1109/twc.2006.1638644.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Menzies, Tim, Zhihao Chen, Jairus Hihn, and Karen Lum. "Selecting Best Practices for Effort Estimation." IEEE Transactions on Software Engineering 32, no. 11 (November 2006): 883–95. http://dx.doi.org/10.1109/tse.2006.114.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Cho, Seong-ho, Ku-bong Min, and Chong-kwon Kim. "Cyclic best-effort multicasting with FEC." Electronics Letters 36, no. 4 (2000): 315. http://dx.doi.org/10.1049/el:20000310.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Best Effort"

1

Qiu, Jun. "Best effort decontamination of networks." Thesis, University of Ottawa (Canada), 2007. http://hdl.handle.net/10393/27908.

Full text
Abstract:
In this thesis we consider the problem to find the optimal strategy to decontaminate the maximum possible number of nodes in a contaminated network with a fixed number of agents. We are given a team of mobile agents located on a node in a contaminated network and the number of agents is not enough to decontaminate the whole network to reach a state in which all nodes are simultaneously clean. We want to find what the maximum number of decontaminated nodes is and how to decontaminate them. In this thesis we consider meshes (regular, octagonal, and hexagonal) and trees and give optimal strategies for those topologies. We also analyze the performance of our strategies according to the number of decontaminated nodes, number of agents' movement and time.
APA, Harvard, Vancouver, ISO, and other styles
2

Rojanarowan, Jerapong. "MPLS-Based Best-Effort Traffic Engineering." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7496.

Full text
Abstract:
MPLS-Based Best-Effort Traffic Engineering Jerapong Rojanarowan 120 Pages Directed by Dr. Henry L. Owen The objective of this research is to develop a multipath traffic engineering framework for best-effort traffic in Multiprotocol Label Switching (MPLS) networks so as to deliver more equal shares of bandwidth to best-effort users as compared to the traditional shortest-path algorithm. The proposed framework is static and the input to the traffic engineering algorithm is restricted to network topology. Performance evaluation of this framework is conducted by simulation using ns-2 network simulator. In a multi-service capable network, some portion of the bandwidth is reserved for guaranteed services and the leftover portion is dedicated to best-effort service. This research examines the problem of traffic engineering for the remaining network bandwidth that is utilized by best-effort traffic where demands are not known a priori. This framework will result in making the limited available best-effort traffic bandwidth more equitably shared by the best-effort flows over a wide range of demands. Traditional traffic engineering research has not examined best-effort traffic.
APA, Harvard, Vancouver, ISO, and other styles
3

Miller, Alan Henry David. "Best effort measurement based congestion control." Thesis, Connect to e-thesis, 2001. http://theses.gla.ac.uk/1015/.

Full text
Abstract:
Thesis (Ph.D.) -- University of Glasgow, 2001.
Includes bibliographical references (p.i-xv). Print version also available. Mode of access : World Wide Web. System requirments : Adobe Acrobat reader reuired to view PDF document.
APA, Harvard, Vancouver, ISO, and other styles
4

Dong, Xin. "Providing best-effort services in dataspace systems /." Thesis, Connect to this title online; UW restricted, 2007. http://hdl.handle.net/1773/6902.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Khalfallah, Sofiane. "Algorithmique best-effort pour les réseaux dynamiques." Compiègne, 2010. http://www.theses.fr/2010COMP1889.

Full text
Abstract:
Les réseaux dynamiques posent de nouvelles difficultés pour la construction d'applications réparties (mobilité, absence d'infrastructure, communication sans-fil, etc. ). Les réseaux ad hoc de véhicules (VANET) représentent un des cas d'étude des réseaux dynamiques. Nous avons commencé les travaux par un état des projets européens concernant les VANETs. Ensuite, nous avons modélisé la norme IEEE 802. 11, qui s'impose comme une technologie sans-fil standard pour la communication entre noeuds mobiles. Nous avons présenté l'algorithmique best-effort qui permet de compléter le concept d'auto-stabilisation afin de gérer la dynamique du réseau. C'est pourquoi nous avons introduit le concept de convergence continue. Ce concept est à rapprocher de la super-stabilisation. L'idée d'une métrique de la dynamique nous est apparue importante (comme la notion de durée d'une ronde continue). Nous avons proposé une application de l'algorithmique best-effort, à savoir un algorithme auto-stabilisant ayant une convergence continue pour la gestion de groupe. Nous avons présenté nos contributions dans la suite logicielle Airplug pour aboutir à une plate-forme complète pour l'évaluation de performances et un prototypage rapide des protocoles best-effort. Nous avons implémenté le protocole réparti GRP qui permet la gestion de groupe dans les réseaux dynamiques et évalué ses performances dans le mode Airplug-ns. Nous avons proposé des métriques appropriées, qui décrivent la stabilité des groupes, pour évaluer les performances de notre protocole
Many problems are open in the design of distributed applications (mobility, ad hoc communication, wireless technology, etc. ). We focus our work on a specific case study of dynamic networks, which is Vehicular ad-hoc networks (VANET). We first establish a state-of-the-art for this field based on the European projects in the VANETs. Second, we model the IEEE 802. 11 standard that tends to be a standard for mobile communication. Best-effort algorithmics allowing to complete the concept of auto-stabilization in the management of dynamic networks are presented. For that aim, we introduce the concept of service continuity. This concept is close to the super-stabilization. We believe that the idea of metrics studying dynamic topologies is important (as the notion of duration of a continuous round). The proposed algorithm works in dynamic and distributed systems. It globally ensures a kind of service continuity to applications while the system is still converging, except if a huge number of topology changes happen. After that, we present our contributions in the Airplug software, as well as in the design and the implementation of a complete platform for performance evaluation and fast prototyping of best-effort protocols. An implementation is done of the distributed protocol GRP to estimate its performances in the Airplug-ns mode. Finally, we propose appropriate metrics that describe the stability of groups in order to evaluate the performance of our protocol
APA, Harvard, Vancouver, ISO, and other styles
6

Ruiz, Sánchez Miguel Ángel. "Optimization of packet forwarding in best-effort routers." Nice, 2003. http://www.theses.fr/2003NICE4029.

Full text
Abstract:
La tâche principale d'un routeur est d'acheminer des paquets jusqu'à leur destination finale en passant par les différentes réseaux. Comme chaque paquet est traité individuellement, la performance d'un routeur dépend du temps nécessaire pour traiter chaque paquet. Due à la croissance et à la diversité du trafic dans l'Internet, le traitement nécessaire pour acheminer des paquets doit être optimisé. Cette thèse propose des algorithmes pour optimiser la performance du traitement de paquets lors de leur acheminement dans les routeurs best-effort. Pour acheminer (réexpédier) des paquets, un routeur doit tout d'abord rechercher l'information de routage correspondant à chaque paquet. La recherche d'information de routage est basée sur l'adresse destination du paquet et elle s'appelle consultation d'adresse. Nous proposons dans cette thèse deux mécanismes pour la mise à jour incrémentale des table de routage basées sur des tries multibit. Tout d'abord, nous déterminons les conditions nécessaires pour supporter des mises à jour incrémentales dans les tries multibit. À partir de ces conditions, nous proposons des algorithmes et des structures de données pour effectuer ces mises à jour incrémentales. En particulier, nous proposons une structure de données que nous appelons le vecteur de bits PN (pour prefix nesting en anglais). Le vecteur de bits PN code un ensemble de préfixes et leurs relations d'inclusion, car cette information est nécessaire pour supporter des mises à jour incrémentales. Nous évaluons la performance de nos mécanismes implémentés en langage C. Nous présentons les performances de nos mécanismes pour les opérations de recherche, insertion et suppression. Nous présentons également les besoins en termes de mémoire. Une deuxième contribution de cette thèse est l'introduction d'une taxonomie et un cadre de référence pour les algorithmes de consultation rapide d'adresse IP. Notre taxonomie est basée sur l'observation que la difficulté de trouver le plus long préfixe commun avec l'adresse destination est sa double dimension: valeur et longueur. Lorsque nous présentons et classifions les différents mécanismes, l'accent est mis sur le type de transformation que l'on effectue sur l'ensemble de préfixes pour chaque mécanisme. Cette approche unificatrice que nous proposons nous permet de comprendre et de comparer les compromis des différentes mécanismes. Nous comparons les mécanismes en termes de leur complexité en temps et en espace. Nous comparons aussi leur performance en mesurant le temps de l'opération de recherche. Ces mesures sont réalisées sur une même plateforme et en utilisant une vrai table de routage. Une troisième contribution de cette thèse est un mécanisme qui optimise l'usage des buffers dans les routeurs pour offrir un haut dégrée d'isolation entre flux. Tout d'abord, nous étudions la fonctionnalité des buffers dans les routeurs et nous déterminons les caractéristiques souhaitables des buffers dans les routeurs. Ensuite nous proposons MuxQ un mécanisme qui fournit un haut degré d'isolation entre flux. MuxQ est basé sur l'idée de protéger la fonction de multiplexage de la fonction d'absorption de rafales d'un buffer. Nous évaluons MuxQ en utilisant le simulateur ns-2. En particulier, nous étudions la capacité de MuxQ pour isoler différent types de flux. Nous comparons les performances de notre mécanisme avec celles des mécanismes Drop-Tail, CSFQ, FRED et DRR. Nous présentons les résultats de simulations avec des conditions de trafic différentes. MuxQ est un mécanisme simple, deployable et qui fournit un haut degré d'isolation de flux, tout en gardant une quantité limitée d'état.
APA, Harvard, Vancouver, ISO, and other styles
7

Andersson, Kajsa, and Simon Mårtensson. "ESG investing in the Eurozone : Portfolio performance of best-effort and best-in-class approaches." Thesis, Umeå universitet, Företagsekonomi, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-161407.

Full text
Abstract:
The last decades have seen a rapid increase of sustainable investing, also known as ESG (Environmental, Social and Governance) investing. There has also been an increasing body of academic literature devoted to whether investors can gain any financial benefits from taking ESG under consideration. Previous literature of portfolio performance in terms of risk-adjusted returns has given much of its attention to best-in-class approaches, which is a strategy that selects top performers in ESG within a sector or industry. The purpose of this study is foremost to investigate a best-effort approach to ESG investing, which is a strategy that focuses on the top improvers in ESG. The purpose is further to compare this with a best-in-class approach, since the findings from earlier studies of this strategy still are inconsistent. The region chosen to perform this study in is the Eurozone. Several theories that have implications for portfolio studies and abnormal returns are taken under consideration in relation to the study and its findings. This includes the efficient market hypothesis, the adaptive market hypothesis and modern portfolio theory. The theoretical framework also cover asset-pricing models and the notions of risk-adjusted returns. A quantitative study with a deductive approach are used to form portfolios, with a Eurozone index as the investable universe. Best-effort and best-in-class portfolios as well as difference portfolios of the two approaches are created, based on ESG data and different cut-off rates for portfolio inclusion. As for risk-adjusted performance measure, the Carhart four-factor model are used. The overall results are mostly insignificant findings in terms of abnormal returns. However, three best-effort portfolios based on the top ESG improvers show significant positive abnormal returns. These findings are strongest for the environmental and social factor. As for the best-in-class approach, only the governance portfolios provided weakly significant results in terms of abnormal returns. Further, the study is not able to significantly distinguish between a best-effort and a best-in-class approach when it comes to risk-adjusted performance. The exception is the environmental factor based on the top performers in each approach, where the best-effort portfolio outperforms the best-in-class portfolio. Finally, none of the portfolios provided significant negative risk-adjusted returns. This can at least be considered as good news for ESG investing, since it indicates that investors do not have to sacrifice risk-adjusted returns in order to invest in a more sustainable way.
APA, Harvard, Vancouver, ISO, and other styles
8

Papri, Rowshon Jahan. "Best effort query answering for mediators with union views." Thesis, Wichita State University, 2011. http://hdl.handle.net/10057/5032.

Full text
Abstract:
Consider an SQL query that involves joins of several relations, optionally followed by selections and/or projections. It can be represented by a conjunctive datalog query Q without negation or arithmetic subgoals. We consider the problem of answering such a query Q using a mediator M. For each relation R that corresponds to a subgoal in Q, M contains several sources; each source for R provides some of the tuples in R. The capability of each source are described in terms of templates. It might not be possible to get all the tuples in the result, Result(Q), using M, due to restrictions imposed by the templates. We consider best-effort query answering: Find as many tuples in Result(Q) as possible. We present an algorithm to determine if Q can be so answered using M.
Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical Engineering and Computer Science.
APA, Harvard, Vancouver, ISO, and other styles
9

Koehler, Bernd G. "Best-effort traffic engineering in multiprotocol label switched networks." Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/14937.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Perera, Bandaralokuge Earl Shehan. "VoIP and best effort service enhancement on fixed WiMAX." Thesis, University of Canterbury. Electrical & Computer Engineering, 2008. http://hdl.handle.net/10092/1575.

Full text
Abstract:
Fixed Broadband Wireless Access (BWA) for the last mile is a promising technology which can offer high speed voice, video and data service and fill the technology gap between Wireless LANs and wide area networks. This is seen as a challenging competitor to conventional wired last mile access systems like DSL and cable, even in areas where those technologies are already available. More importantly the technology can provide a cost-effective broadband access solution in rural areas beyond the reach of DSL or cable and in developing countries with little or no wired last mile infrastructure. Earlier BWA systems were based on proprietary technologies which made them costly and impossible to interoperate. The IEEE 802.16 set of standards was developed to level the playing field. An industry group the WiMAX Forum, was established to promote interoperability and compliance to this standard. This thesis gives an overview of the IEEE 802.16 WirelessMAN OFDM standard which is the basis for Fixed WiMAX. An in depth description of the medium access control (MAC) layer is provided and functionality of its components explained. We have concentrated our effort on enhancing the performance of Fixed WiMAX for VoIP services, and best effort traffic which includes e-mail, web browsing, peer-to-peer traffic etc. The MAC layer defines four native service classes for differentiated QoS levels from the onset. The unsolicited grant service (UGS) class is designed to support real-time data streams consisting of fixed-size data packets issued at periodic intervals, such as T1/E1 and Voice over IP without silence suppression, while the non-real-time polling service (nrtPS) and best effort (BE) are meant for lower priority traffic. QoS and efficiency are at opposite ends of the scale in most cases, which makes it important to identify the trade-off between these two performance measures of a system. We have analyzed the effect the packetization interval of a UGS based VoIP stream has on system performance. The UGS service class has been modified so that the optimal packetization interval for VoIP can be dynamically selected based on PHY OFDM characteristics. This involves cross layer communication between the PHY, MAC and the Application Layer and selection of packetization intervals which keep the flow within packet loss and latency bounds while increasing efficiency. A low latency retransmission scheme and a new ARQ feedback scheme for UGS have also been introduced. The goal being to guarantee QoS while increasing system efficiency. BE traffic when serviced by contention based access is variable in speed and latency, and low in efficiency. A detailed analysis of the contention based access scheme is done using Markov chains. This leads to optimization of system parameters to increase utilization and reduce overheads, while taking into account TCP as the most common transport layer protocol. nrtPS is considered as a replacement for contention based access. Several enhancements have been proposed to increase efficiency and facilitate better connection management. The effects of proposed changes are validated using analytical models in Matlab and verified using simulations. A simulation model was specifically created for IEEE 802.16 WirelessMAN OFDM in the QualNet simulation package. In essence the aim of this work was, to develop means to support a maximum number of users, with the required level of service, using the limited wireless resource.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Best Effort"

1

F for effort!: More of the very best totally wrong test answers. San Francisco: Chronicle Books, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Mark, Hirschfeld, ed. Re-engage!: How the best places to work inspire extra effort in extraordinary times. New York: McGraw-Hill, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Branham, Leigh. Re-engage!: How the best places to work inspire extra effort in extraordinary times. New York: McGraw-Hill, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Patterson, Colin S. An evaluation of how a solicitors practice may best promote itself in an effort to increase its share of the conveyancing market in the Greater Newtownards/Comber town areas. [s.l: The Author], 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wade, Kate. Truancy reduction efforts: Best practices review. Madison, WI: Legislative Audit Bureau, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wade, Kate. Truancy reduction efforts: Best practices review. Madison, WI: Legislative Audit Bureau, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wade, Kate. Truancy reduction efforts: Best practices review. Madison, WI: Legislative Audit Bureau, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bezruki, Don. Truancy reduction efforts: A best practices review. Madison, WI: Wisconsin Legislative Audit Bureau, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ripple effect. Victoria, British Columbia: Orca Book Publishers, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Sabuco, John J. The best of the hardiest. 2nd ed. Flosmoor, Ill: Good Earth Pub., 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Best Effort"

1

Trendowicz, Adam, and Ross Jeffery. "Effort Estimation Best Practices." In Software Project Effort Estimation, 401–32. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-03629-8_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wolfe, Charles R. "Capturing the Best Urban Diary Examples." In Urbanism Without Effort, 81–123. Washington, DC: Island Press/Center for Resource Economics, 2019. http://dx.doi.org/10.5822/978-1-61091-962-3_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Heckmann, Oliver, and Jens B. Schmitt. "Best-Effort Versus Reservations Revisited." In Quality of Service – IWQoS 2005, 151–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11499169_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Danthine, A., and O. Bonaventure. "From Best Effort to Enhanced QoS." In Architecture and Protocols for High-Speed Networks, 179–201. Boston, MA: Springer US, 1994. http://dx.doi.org/10.1007/978-1-4757-4536-8_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

de Koning Gans, Gerhard, and Eric R. Verheul. "Best Effort and Practice Activation Codes." In Trust, Privacy and Security in Digital Business, 98–112. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22890-2_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Nahrstedt, Klara, and Shigang Chen. "Coexistence of QoS and Best-Effort Flows." In Multimedia Communications, 175–88. London: Springer London, 1999. http://dx.doi.org/10.1007/978-1-4471-0859-7_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Talebi, Mohammad S., Fahimeh Jafari, Ahmad Khonsari, and Mohammad H. Yaghmaee. "Best Effort Flow Control in Network-on-Chip." In Communications in Computer and Information Science, 990–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-89985-3_150.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Freitas, André, João Gabriel Oliveira, Seán O’Riain, Edward Curry, and João Carlos Pereira da Silva. "Treo: Best-Effort Natural Language Queries over Linked Data." In Natural Language Processing and Information Systems, 286–89. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22327-3_40.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Chown, Tim, Tiziana Ferrari, Simon Leinen, Roberto Sabatino, Nicolas Simar, and Stig Venaas. "Less than Best Effort: Application Scenarios and Experimental Results." In Quality of Service in Multiservice IP Networks, 131–44. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-36480-3_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Halevy, Alon. "Best-Effort Modeling of Structured Data on the Web." In Conceptual Modeling – ER 2011, 32. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24606-7_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Best Effort"

1

Chakradhar, Srimat T., and Anand Raghunathan. "Best-effort computing." In the 47th Design Automation Conference. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1837274.1837492.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Carlberg, Ken, Panos Gevros, and Jon Crowcroft. "Lower than best effort." In Workshop. New York, New York, USA: ACM Press, 2001. http://dx.doi.org/10.1145/371626.371813.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Breslau, Lee, and Scott Shenker. "Best-effort versus reservations." In the ACM SIGCOMM '98 conference. New York, New York, USA: ACM Press, 1998. http://dx.doi.org/10.1145/285237.285248.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Shen, Warren, Pedro DeRose, Robert McCann, AnHai Doan, and Raghu Ramakrishnan. "Toward best-effort information extraction." In the 2008 ACM SIGMOD international conference. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1376616.1376718.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Smith, B. R., and J. J. Garcia-Luna-Aceves. "Best Effort Quality-of-Service." In 17th International Conference on Computer Communications and Networks 2008. IEEE, 2008. http://dx.doi.org/10.1109/icccn.2008.ecp.84.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Leonardi, G., A. Bazzi, G. Pasolini, and O. Andrisano. "IEEE802.16e Best Effort Performance Investigation." In 2007 IEEE International Conference on Communications. IEEE, 2007. http://dx.doi.org/10.1109/icc.2007.798.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lau, Peter S. "A Best-Effort Multicast Algorithm." In 2006 International Conference on Communication Technology. IEEE, 2006. http://dx.doi.org/10.1109/icct.2006.341673.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Mrabet, Cyrine, Mohamed Ali Kaafar, and Farouk Kamoun. "Wireless alternative best effort service." In the 2006 ACM CoNEXT conference. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1368436.1368475.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Jayabal, Yamini, Yue Fei, Andrea Fumagalli, Rosanna Pastorelli, Gabriele Galimberti, and Giovanni Martinelli. "Best Effort Multi-Rate Optical Networks." In Optical Fiber Communication Conference. Washington, D.C.: OSA, 2015. http://dx.doi.org/10.1364/ofc.2015.th2a.42.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Furuhashi, Yuzuki, Masaki Matsubara, and Atsuyuki Morishima. "Crowd-based best-effort number estimation." In 2017 IEEE International Conference on Big Data (Big Data). IEEE, 2017. http://dx.doi.org/10.1109/bigdata.2017.8258468.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Best Effort"

1

Welzl, M., and D. Ros. A Survey of Lower-than-Best-Effort Transport Protocols. RFC Editor, June 2011. http://dx.doi.org/10.17487/rfc6297.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Floyd, S., and M. Allman. Comments on the Usefulness of Simple Best-Effort Traffic. RFC Editor, July 2008. http://dx.doi.org/10.17487/rfc5290.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dinda, Peter A., Bruce Lowekamp, Loukas Kallivokas, and David R. O'Hallaron. The Case For Prediction-based Best-effort Real-time Systems. Fort Belvoir, VA: Defense Technical Information Center, January 1999. http://dx.doi.org/10.21236/ada360937.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cristobal, Ricardo. How Best to Organize and Optimize the Analytical Effort Within the US Intelligence Community. Fort Belvoir, VA: Defense Technical Information Center, March 2010. http://dx.doi.org/10.21236/ada544318.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Torres, Isaac, and Marvin L. Ross. How Can We Best Achieve Contracting Unity of Effort in the CENTCOM Area of Responsibility? Fort Belvoir, VA: Defense Technical Information Center, November 2013. http://dx.doi.org/10.21236/ada613002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Torres, Isaac, and Marvin Ross. How Can We Best Achieve Contracting Unity of Effort in the CENTCOM Area of Responsibility? Fort Belvoir, VA: Defense Technical Information Center, December 2013. http://dx.doi.org/10.21236/ada620490.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kemp, Michelle R. Unity of Effort: How Can the JFMCC Best Support the JFACC in Integrated Air and Missile Defense. Fort Belvoir, VA: Defense Technical Information Center, May 2010. http://dx.doi.org/10.21236/ada525291.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Naves, Claudia, David Amorim, David Geisler-Moroder, Thorbjörn Laike, Justyna Martyniuk-Peczek, Barbara Szybinska Matusiak, Wilfried Pohl, and Natalia Sokol. Literature review of user needs, toward user requirements. Edited by Barbara Szybinska Matusiak. IEA SHC Task 61, September 2020. http://dx.doi.org/10.18777/ieashc-task61-2020-0001.

Full text
Abstract:
This report has been developed in the frame of the IEA SHC Task 61 Subtask A “User requirements”. The main objective was to rethink and reformulate user requirements to lighting (daylighting and electric lighting) in public buildings on the basis of a thorough literature study. The work is a joint effort of a number of scientists and represents collective knowledge in this topic. The concept of Lighting quality is the one, among many lighting concepts, which expresses the user perspective best. Lighting quality is the important goal of lighting designers and planners; however, it is difficult to define and to measure.
APA, Harvard, Vancouver, ISO, and other styles
9

Spangler, Stephen, Roger Fujan, Carl Broyles, Brian Baker, Justin Jameson, Gerald Piotrowski, John Groboski, and Steve Hutsell. Record Package guidance : best practices. Engineer Research and Development Center (U.S.), August 2021. http://dx.doi.org/10.21079/11681/41460.

Full text
Abstract:
The CAD/BIM Technology Center receives numerous questions throughout the year regarding the development of a Record Package that shows as-built conditions. While the Center does produce Standards on the look and organization of CAD drawings that are used to show as-built conditions, users wanted guidance on the Record Package development. The Chicago District had undertaken the development of such guidance, but a formal document was never officially released. The CAD/BIM Community of Practice (CoP) Work Structure Committee finished this guidance and their efforts are reflected in this document.
APA, Harvard, Vancouver, ISO, and other styles
10

Clark, Andrew E. Demography and well-being. Verlag der Österreichischen Akademie der Wissenschaften, January 2021. http://dx.doi.org/10.1553/populationyearbook2021.deb02.

Full text
Abstract:
Demography studies the characteristics of populations. One such characteristic is well-being: this was the subject of the 2019 Wittgenstein Conference. Here, I discuss how objective well-being domains can be summarised to produce an overall well-being score, and how taking self-reported (subjective) well-being into account may help in this effort. But given that there is more than one type of subjective well-being score, we would want to know which one is “best”. We would also need to decide whose well-being counts, or counts more than that of others. Finally, I briefly mention the potential role of adaptation and social comparisons in the calculation of societal well-being.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Best Effort' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography