Sciweavers

4843 search results - page 353 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
CP
2004
Springer
15 years 9 months ago
Counting-Based Look-Ahead Schemes for Constraint Satisfaction
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
Kalev Kask, Rina Dechter, Vibhav Gogate
CEC
2008
IEEE
15 years 6 months ago
Automated solution selection in multi-objective optimisation
This paper proposes an approach to the solution of multi-objective optimisation problems that delivers a single, preferred solution. A conventional, population-based, multiobjectiv...
Andrew Lewis, David Ireland
NIPS
2007
15 years 5 months ago
Fast Variational Inference for Large-scale Internet Diagnosis
Web servers on the Internet need to maintain high reliability, but the cause of intermittent failures of web transactions is non-obvious. We use approximate Bayesian inference to ...
John C. Platt, Emre Kiciman, David A. Maltz
EUSFLAT
2003
206views Fuzzy Logic» more  EUSFLAT 2003»
15 years 5 months ago
Analysis of multi-product break-even with uncertain information
We revise the classic methodology to find the multi-product break-even point. In the current paper we propose a solution to the problem under uncertainty conditions, based on DurÃ...
Luisa L. Lazzari, María Silvia Moriñ...
CCCG
1997
15 years 5 months ago
Label placement by maximum independent set in rectangles
Motivated by the problem of labeling maps, we investigate the problem of computing a large non-intersecting subset in a set of n rectangles in the plane. Our results are as follow...
Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Su...