1952 search results - page 383 / 391 » Complete partitions of graphs |
167
Voted
FOCS
2005
IEEE
16 years 1 months ago
2005
IEEE
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
211
click to vote
ATAL
2005
Springer
16 years 1 months ago
2005
Springer
Methods for solving Distributed Constraint Optimization Problems (DCOP) have emerged as key techniques for distributed reasoning. Yet, their application faces significant hurdles...
213
Voted
SG
2005
Springer
16 years 29 days ago
2005
Springer
Parametric design systems model a design as a constrained collection of schemata. Designers work in such systems at two levels: definition of schemata and constraints; and search w...
208
click to vote
AMAI
2004
Springer
16 years 27 days ago
2004
Springer
Learning the parameters (conditional and marginal probabilities) from a data set is a common method of building a belief network. Consider the situation where we have known graph s...
240
Voted
ICWL
2004
Springer
16 years 26 days ago
2004
Springer
This paper describes a system for the animation of algorithms on an electronic chalkboard. The instructor teaching an algorithm can enter data directly through a drawing- the algor...