Sciweavers

31 search results - page 4 / 7
» Practical Key-recovery For All Possible Parameters of SFLASH
Sort
View
DISOPT
2011
210views Education» more  DISOPT 2011»
14 years 4 months ago
The parameterized complexity of k-flip local search for SAT and MAX SAT
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
Stefan Szeider
71
Voted
ECAI
2004
Springer
15 years 3 months ago
Indirect and Conditional Sensing in the Event Calculus
Controlling the sensing of an environment by an agent has been accepted as necessary for effective operation within most practical domains. Usually, however, agents operate in par...
Jeremy Forth, Murray Shanahan
EAAI
2007
90views more  EAAI 2007»
14 years 9 months ago
AI techniques in modelling, assignment, problem solving and optimization
This paper recapitulates the results of a long research on a family of artificial intelligence (AI) methods—relying on, e.g., artificial neural networks and search techniques...
Zsolt János Viharos, Zsolt Kemény
ICTAI
2009
IEEE
14 years 7 months ago
A Generalized Cyclic-Clustering Approach for Solving Structured CSPs
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
Cédric Pinto, Cyril Terrioux
83
Voted
ALT
2006
Springer
15 years 6 months ago
Active Learning in the Non-realizable Case
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
Matti Kääriäinen