801 search results - page 11 / 161 » A Knowledge-theoretic Approach to Distributed Problem Solvin... |
157
click to vote
CSCLP
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Constraint solving problems (CSPs) represent a formalization of an important class of problems in computer science. We propose here a solving methodology based on the nam...
136
Voted
PPSN
2010
Springer
15 years 28 days ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
127
click to vote
PODC
2009
ACM
15 years 7 months ago
2009
ACM
A failure detector is a distributed oracle that provides processes in a distributed system with hints about failures. The notion of a weakest failure detector captures the exact a...
150
Voted
ESA
2011
Springer
14 years 2 months ago
2011
Springer
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
149
Voted
CLOUDCOM
2010
Springer
15 years 16 days ago
2010
Springer
Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one of the popular heuristic methods for solving hard problems, such as the Job Shop Scheduling Problem (JSSP...