Sciweavers

14518 search results - page 242 / 2904
» Two Problems for Sophistication
Sort
View
81
Voted
IJCAI
1993
15 years 2 months ago
Genetic State-Space Search for Constrained Optimization Problems
This paper introduces GSSS (Genetic State-Space Search). The integration of two general search paradigms — genetic search and state-space-search provides a general framework whi...
Jan Paredis
100
Voted
IJCAI
1989
15 years 2 months ago
Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems
This paper presents an evaluation of two orthogonal schemes for improving the efficiency of solving constraint satisfaction problems (CSPs). The first scheme involves a class of p...
Rina Dechter, Itay Meiri
94
Voted
IPL
2006
83views more  IPL 2006»
15 years 23 days ago
The Pair Completion algorithm for the Homogeneous Set Sandwich Problem
A homogeneous set is a non-trivial module of a graph, i.e. a nonempty, non-unitary, proper vertex subset such that all its elements present the same outer neighborhood. Given two ...
Claudson F. Bornstein, Celina M. Herrera de Figuei...
96
Voted
ORL
2008
99views more  ORL 2008»
15 years 23 days ago
Some tractable instances of interval data minmax regret problems
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Bruno Escoffier, Jérôme Monnot, Olivi...
TIT
2008
90views more  TIT 2008»
15 years 21 days ago
On Optimal Quantization Rules for Some Problems in Sequential Decentralized Detection
We consider the design of systems for sequential decentralized detection, a problem that entails several interdependent choices: the choice of a stopping rule (specifying the samp...
XuanLong Nguyen, Martin J. Wainwright, Michael I. ...