Sciweavers

408 search results - page 31 / 82
» A lookahead strategy for solving large planning problems
Sort
View
77
Voted
CAEPIA
2007
Springer
15 years 3 months ago
Fast and Informed Action Selection for Planning with Sensing
Consider a robot whose task is to pick up some colored balls from a grid, taking the red balls to a red spot, the blue balls to a blue spot and so on, one by one, without knowing e...
Alexandre Albore, Héctor Palacios, Hector G...
126
Voted
SIGMOD
2006
ACM
106views Database» more  SIGMOD 2006»
15 years 9 months ago
Run-time operator state spilling for memory intensive long-running queries
Main memory is a critical resource when processing longrunning queries over data streams with state intensive operators. In this work, we investigate state spill strategies that h...
Bin Liu, Yali Zhu, Elke A. Rundensteiner
CP
2008
Springer
14 years 10 months ago
Search Strategies for Rectangle Packing
Rectangle (square) packing problems involve packing all squares with sizes 1 × 1 to n × n into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a...
Helmut Simonis, Barry O'Sullivan
ICDE
2007
IEEE
174views Database» more  ICDE 2007»
15 years 4 months ago
Adapting Partitioned Continuous Query Processing in Distributed Systems
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...
Yali Zhu, Elke A. Rundensteiner
AIPS
2006
14 years 11 months ago
Evaluating Mixed-Initiative Systems: An Experimental Approach
Mixed-Initiative approaches to Planning and Scheduling are being applied in different real world domains. While several recent successful examples of such tools encourage a wider ...
Gabriella Cortellessa, Amedeo Cesta