Sciweavers

365 search results - page 60 / 73
» An Approach to Multiply Segmented Constraint Satisfaction Pr...
Sort
View
ICML
2007
IEEE
14 years 8 months ago
What is decreased by the max-sum arc consistency algorithm?
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
Tomás Werner
ICCAD
1999
IEEE
84views Hardware» more  ICCAD 1999»
13 years 11 months ago
OPTIMISTA: state minimization of asynchronous FSMs for optimum output logic
The optimal state minimization problem is to select a reduced state machine having the best logic implementation over all possible state reductions and encodings. A recent algorit...
Robert M. Fuhrer, Steven M. Nowick
CEC
2007
IEEE
13 years 11 months ago
Solving, rating and generating Sudoku puzzles with GA
This paper studies the problems involved in solving, rating and generating Sudoku puzzles with genetic algorithms (GA). Sudoku is a number puzzle that has recently become a worldwi...
Timo Mantere, Janne Koljonen
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 7 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
DSS
2008
127views more  DSS 2008»
13 years 7 months ago
Cross-lingual thesaurus for multilingual knowledge management
The Web is a universal repository of human knowledge and culture which has allowed unprecedented sharing of ideas and information in a scale never seen before. It can also be cons...
Christopher C. Yang, Chih-Ping Wei, K. W. Li