Sciweavers

1300 search results - page 155 / 260
» Constraint satisfaction problems and global cardinality cons...
Sort
View
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
15 years 10 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
TROB
2010
100views more  TROB 2010»
14 years 4 months ago
Predictive Control for Constrained Image-Based Visual Servoing
This paper deals with the image-based visual servoing (IBVS), subject to constraints. Robot workspace limitations, visibility constraints, and actuators limitations are addressed. ...
Guillaume Allibert, Estelle Courtial, Franç...
IJCAI
2001
14 years 11 months ago
Balance and Filtering in Structured Satisfiable Problems
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas...
HICSS
1994
IEEE
149views Biometrics» more  HICSS 1994»
15 years 2 months ago
Stochastic Problem Solving by Local Computation Based on Self-Organization Paradigm
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...
Yasusi Kanada, Masao Hirokawa
SAC
1998
ACM
15 years 2 months ago
Off-line scheduling of a real-time system
This paper shows how a recently introduced class of applications can be solved by constraint programming. This new type of application is due to the emergence of special real-time...
Klaus Schild, Jörg Würtz