Sciweavers

1191 search results - page 143 / 239
» Completeness and Performance Of The APO Algorithm
Sort
View
AAAI
1994
14 years 11 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
BMCBI
2006
74views more  BMCBI 2006»
14 years 10 months ago
An unsupervised classification scheme for improving predictions of prokaryotic TIS
Background: Although it is not difficult for state-of-the-art gene finders to identify coding regions in prokaryotic genomes, exact prediction of the corresponding translation ini...
Maike Tech, Peter Meinicke
ATAL
2007
Springer
15 years 4 months ago
Auction-based multi-robot task allocation in COMSTAR
Over the past few years, swarm based systems have emerged as an attractive paradigm for building large scale distributed systems composed of numerous independent but coordinating ...
Matthew Hoeing, Prithviraj Dasgupta, Plamen V. Pet...
INFOCOM
2005
IEEE
15 years 3 months ago
Joint optimal scheduling and routing for maximum network throughput
— In this paper we consider packet networks loaded by admissible traffic patterns, i.e. by traffic patterns that, if optimally routed, do not overload network resources. In the...
Emilio Leonardi, Marco Mellia, Marco Ajmone Marsan...
IPCO
2007
108views Optimization» more  IPCO 2007»
14 years 11 months ago
Robust Combinatorial Optimization with Exponential Scenarios
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S...