Sciweavers

138 search results - page 17 / 28
» Finding an optimal tree searching strategy in linear time
Sort
View
CDC
2008
IEEE
102views Control Systems» more  CDC 2008»
14 years 12 days ago
Search decisions for teams of automata
Abstract-- The dynamics of exploration vs exploitation decisions are explored in the context of robotic search problems. Building on prior work on robotic search together with our ...
Dimitar Baronov, John Baillieul
AAAI
2007
14 years 22 days ago
Optimal Multi-Agent Scheduling with Constraint Programming
We consider the problem of computing optimal schedules in multi-agent systems. In these problems, actions of one agent can influence the actions of other agents, while the object...
Willem Jan van Hoeve, Carla P. Gomes, Bart Selman,...
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
14 years 3 months ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca
AIPS
2010
13 years 10 months ago
Forward-Chaining Partial-Order Planning
Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of researchers returning to the partial-order planning approach...
Amanda Jane Coles, Andrew Coles, Maria Fox, Derek ...
ICDE
2010
IEEE
203views Database» more  ICDE 2010»
14 years 2 months ago
Optimizing ETL workflows for fault-tolerance
Extract-Transform-Load (ETL) processes play an important role in data warehousing. Typically, design work on ETL has focused on performance as the sole metric to make sure that the...
Alkis Simitsis, Kevin Wilkinson, Umeshwar Dayal, M...