Sciweavers

43 search results - page 3 / 9
» Phase Transitions of Bounded Satisfiability Problems
Sort
View
JUCS
2007
118views more  JUCS 2007»
13 years 4 months ago
Satisfying Assignments of Random Boolean Constraint Satisfaction Problems: Clusters and Overlaps
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
Gabriel Istrate
CLIMA
2010
13 years 4 months ago
Is Computational Complexity a Barrier to Manipulation?
When agents are acting together, they may need a simple mechanism to decide on joint actions. One possibility is to have the agents express their preferences in the form of a ballo...
Toby Walsh
ILP
2007
Springer
13 years 11 months ago
A Phase Transition-Based Perspective on Multiple Instance Kernels
: This paper is concerned with relational Support Vector Machines, at the intersection of Support Vector Machines (SVM) and relational learning or Inductive Logic Programming (ILP)...
Romaric Gaudel, Michèle Sebag, Antoine Corn...
ECAI
2008
Springer
13 years 6 months ago
Incremental Diagnosis of DES by Satisfiability
Abstract. We propose a SAT-based algorithm for incremental diagnosis of discrete-event systems. The monotonicity is ensured by a prediction window that uses the future observations...
Alban Grastien, Anbulagan
CGF
2000
81views more  CGF 2000»
13 years 4 months ago
Generating Consistent Motion Transition via Decoupled Framespace Interpolation
espace interpolation algorithm abstracts motion sequences as 1D signals, and interpolates between them to create higher dimension signals, with weights drawn from a user specified...
Golam Ashraf, Kok Cheong Wong