9325 search results - page 211 / 1865 » The decentralized implementability problem |
146
click to vote
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
This paperpresents new resultson anapproach for solvingsatisfiability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field ...
130
click to vote
ESA
1998
Springer
15 years 7 months ago
1998
Springer
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent ...
127
Voted
PPSN
1998
Springer
15 years 7 months ago
1998
Springer
This paper presents a comparative study of Evolutionary Algorithms (EAs) for Constraint Satisfaction Problems (CSPs). We focus on EAs where fitness is based on penalization of cons...
92
Voted
ICDE
2007
IEEE
15 years 7 months ago
2007
IEEE
The paper introduces the problem of designing dynamic workload management (WM) tools that are aware of the diversity of classes of users and their diverse access patterns. Our app...
CONCUR
2010
Springer
15 years 4 months ago
2010
Springer
This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs ar...