Sciweavers

531 search results - page 62 / 107
» Using Abstraction for Planning in Sokoban
Sort
View
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 5 months ago
Solving satisfiability problems with preferences
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
DPD
2010
153views more  DPD 2010»
13 years 5 months ago
Cardinality estimation and dynamic length adaptation for Bloom filters
Abstract Bloom filters are extensively used in distributed applications, especially in distributed databases and distributed information systems, to reduce network requirements and...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
IJRR
2010
110views more  IJRR 2010»
13 years 5 months ago
Object Detection and Tracking for Autonomous Navigation in Dynamic Environments
Abstract We address the problem of vision-based navigation in busy inner-city locations, using a stereo rig mounted on a mobile platform. In this scenario semantic information beco...
Andreas Ess, Konrad Schindler, Bastian Leibe, Luc ...
TMC
2011
223views more  TMC 2011»
13 years 2 months ago
Bidirectionally Coupled Network and Road Traffic Simulation for Improved IVC Analysis
Abstract—Recently, many efforts have been made to develop more efficient Inter-Vehicle Communication (IVC) protocols for ondemand route planning according to observed traffic con...
Christoph Sommer, Reinhard German, Falko Dressler
PLDI
2006
ACM
14 years 1 months ago
Context-sensitive domain-independent algorithm composition and selection
Progressing beyond the productivity of present-day languages appears to require using domain-specific knowledge. Domain-specific languages and libraries (DSLs) proliferate, but ...
Troy A. Johnson, Rudolf Eigenmann