9842 search results - page 1360 / 1969 » The Complexity of the Matching-Cut Problem |
212
click to vote
WISE
2005
Springer
16 years 24 days ago
2005
Springer
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
222
click to vote
PLDI
2005
ACM
16 years 24 days ago
2005
ACM
Reuse of existing code from class libraries and frameworks is often difficult because APIs are complex and the client code required to use the APIs can be hard to write. We obser...
198
click to vote
SIGECOM
2005
ACM
16 years 24 days ago
2005
ACM
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...
222
click to vote
CODES
2003
IEEE
16 years 16 days ago
2003
IEEE
In the Sesame framework, we develop a modeling and simulation environment for the efficient design space exploration of heterogeneous embedded systems. Since Sesame recognizes se...
209
click to vote
ATAL
2003
Springer
16 years 14 days ago
2003
Springer
Decentralized control of a cooperative multi-agent system is the problem faced by multiple decision-makers that share a common set of objectives. The decision-makers may be robots...