Sciweavers

1047 search results - page 56 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
ESA
2010
Springer
183views Algorithms» more  ESA 2010»
13 years 9 months ago
Spatio-temporal Range Searching over Compressed Kinetic Sensor Data
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...
Sorelle A. Friedler, David M. Mount
FORMATS
2004
Springer
14 years 1 months ago
Lazy Approximation for Dense Real-Time Systems
We propose an effective and complete method for verifying safety and properties of timed systems, which is based on predicate abstraction for g finite abstractions of timed autom...
Maria Sorea
EVOW
2011
Springer
12 years 11 months ago
Local Search for Mixed-Integer Nonlinear Optimization: A Methodology and an Application
Abstract. A methodology is presented for tackling mixed-integer nonlinear optimization problems by local search, in particular large-scale real-life problems. This methodology is i...
Frédéric Gardi, Karim Nouioua
AAAI
2006
13 years 9 months ago
Cost-Optimal External Planning
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costop...
Stefan Edelkamp, Shahid Jabbar
ICDCS
2008
IEEE
14 years 2 months ago
Utility-Based Opportunistic Routing in Multi-Hop Wireless Networks
—Recently, opportunistic routing (OR) has been widely used to compensate for the low packet delivery ratio of multi-hop wireless networks. Previous works either provide heuristic...
Jie Wu, Mingming Lu, Feng Li