Sciweavers

4047 search results - page 35 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
CORR
2007
Springer
217views Education» more  CORR 2007»
14 years 11 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
ECCC
2010
74views more  ECCC 2010»
14 years 11 months ago
Testing linear-invariant non-linear properties: A short report
The rich collection of successes in property testing raises a natural question: Why are so many different properties turning out to be locally testable? Are there some broad "...
Arnab Bhattacharyya, Victor Chen, Madhu Sudan, Nin...
76
Voted
AI
2008
Springer
14 years 12 months ago
Properties of tree convex constraints
It is known that a tree convex network is globally consistent if it is path consistent. However, if a tree convex network is not path consistent, enforcing path consistency on it ...
Yuanlin Zhang, Eugene C. Freuder
ECAI
2006
Springer
15 years 3 months ago
Verifying Interlevel Relations Within Multi-Agent Systems
An approach to handle the complex dynamics of a multi-agent system is based on distinguishing aggregation levels by structuring the system into parts or components. The behavior of...
Alexei Sharpanskykh, Jan Treur
BMCBI
2006
100views more  BMCBI 2006»
14 years 11 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong