Sciweavers

1995 search results - page 100 / 399
» What's the Problem
Sort
View
100
Voted
HEURISTICS
2007
76views more  HEURISTICS 2007»
15 years 3 months ago
Metaheuristics can solve sudoku puzzles
: In this paper we present, to our knowledge, the first application of a metaheuristic technique to the very popular and NP-complete puzzle known as ‘sudoku’. We see that this ...
Rhyd Lewis
124
Voted
JAR
2007
132views more  JAR 2007»
15 years 3 months ago
Visualizing SAT Instances and Runs of the DPLL Algorithm
SAT-solvers have turned into essential tools in many areas of applied logic like, for example, hardware verification or satisfiability checking modulo theories (SMT). And althoug...
Carsten Sinz
148
Voted
TOCL
2008
102views more  TOCL 2008»
15 years 3 months ago
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying
Cryptographic protocols with single blind copying were defined and modeled by Comon and Cortier using the new class C of first order clauses, which extends the Skolem class. They s...
Helmut Seidl, Kumar Neeraj Verma
COGSCI
2004
80views more  COGSCI 2004»
15 years 3 months ago
Reinstatement, floating conclusions, and the credulity of Mental Model reasoning
Johnson-Laird and coworkers' Mental Model theory of propositional reasoning is shown to be somewhere in between what logicians have defined as "credulous" and "...
Jean-François Bonnefon
ACL
2009
15 years 1 months ago
Compiling a Massive, Multilingual Dictionary via Probabilistic Inference
Can we automatically compose a large set of Wiktionaries and translation dictionaries to yield a massive, multilingual dictionary whose coverage is substantially greater than that...
Mausam, Stephen Soderland, Oren Etzioni, Daniel S....