Sciweavers

7930 search results - page 527 / 1586
» Greedy in Approximation Algorithms
Sort
View
ACL
2010
15 years 5 months ago
Dynamic Programming for Linear-Time Incremental Parsing
Incremental parsing techniques such as shift-reduce have gained popularity thanks to their efficiency, but there remains a major problem: the search is greedy and only explores a ...
Liang Huang, Kenji Sagae
GLOBECOM
2010
IEEE
15 years 5 months ago
Prediction Assisted Single-Copy Routing in Underwater Delay Tolerant Networks
One challenge in delay tolerant networks (DTNs) is efficient routing, as the lack of contemporaneous end-to-end paths makes conventional routing schemes inapplicable. Many existing...
Zheng Guo, Bing Wang, Jun-Hong Cui
KI
2010
Springer
15 years 5 months ago
Situation-Specific Intention Recognition for Human-Robot Cooperation
Recognizing human intentions is part of the decision process in many technical devices. In order to achieve natural interaction, the required estimation quality and the used comput...
Peter Krauthausen, Uwe D. Hanebeck
CORR
2011
Springer
208views Education» more  CORR 2011»
15 years 2 months ago
GRASP and path-relinking for Coalition Structure Generation
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
CISS
2010
IEEE
14 years 10 months ago
Transmission coordination for ad hoc networks
— AHNs are wireless networks operating without the benefits of network infrastructure (basestations) or centralized control. AHNs working with limited spectrum perform best when...
Ananth V. Kini, Steven Weber, Fadi A. Aloul, Nagar...