6562 search results - page 127 / 1313 » Noetherianity and Combination Problems |
128
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
121
click to vote
IAT
2006
IEEE
15 years 10 months ago
2006
IEEE
We present a new approach to distributed problem solving based on high-level program execution. While this technique has proven itself for single-agent systems based on the Golog ...
124
click to vote
CPAIOR
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Recently, new cost-based filtering algorithms for shorter-path constraints have been developed. However, so far only the theoretical properties of shorter-path constrain...
127
click to vote
AUSAI
2004
Springer
15 years 10 months ago
2004
Springer
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
153
click to vote
IJCAI
2007
15 years 6 months ago
2007
We evaluate a new hybrid language processing approach designed for interactive applications that maintain an interaction with users over multiple turns. Specifically, we describe ...