1191 search results - page 143 / 239 » Completeness and Performance Of The APO Algorithm |
159
click to vote
AAAI
1994
15 years 4 months ago
1994
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...
116
click to vote
BMCBI
2006
15 years 3 months ago
2006
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...
148
Voted
ATAL
2007
Springer
15 years 9 months ago
2007
Springer
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 ...
138
Voted
INFOCOM
2005
IEEE
15 years 9 months ago
2005
IEEE
— 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...
147
Voted
IPCO
2007
15 years 4 months ago
2007
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...