Sciweavers

2925 search results - page 284 / 585
» Information Complexity of Online Problems
Sort
View
TOPLAS
2008
81views more  TOPLAS 2008»
15 years 6 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
PPSN
2000
Springer
15 years 10 months ago
Optimizing through Co-evolutionary Avalanches
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
Stefan Boettcher, Allon G. Percus, Michelangelo Gr...
CIKM
2008
Springer
15 years 8 months ago
A heuristic approach for checking containment of generalized tree-pattern queries
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
Pawel Placek, Dimitri Theodoratos, Stefanos Soulda...
WWW
2003
ACM
16 years 7 months ago
Monitoring the dynamic web to respond to continuous queries
Continuous queries are queries for which responses given to users must be continuously updated, as the sources of interest get updated. Such queries occur, for instance, during on...
Sandeep Pandey, Krithi Ramamritham, Soumen Chakrab...
ADT
2008
15 years 6 months ago
Analytical investigation of intersection based range-free localization
By range-free localization, the positions of a mobile device can be limited to the coverage area of a radio access network cell. The drawback of such approach is the coarseness of ...
Michel Sortais, Sven D. Hermann, Adam Wolisz