13376 search results - page 418 / 2676 » Problem Solving with |
117
Voted
CP
2003
Springer
15 years 10 months ago
2003
Springer
This paper presents two methods for improving the performance of the Distributed Breakout Algorithm using the notion of interchangeability. In particular, we use neighborhood part...
148
Voted
CEC
2003
IEEE
15 years 10 months ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
159
click to vote
TCS
2008
15 years 4 months ago
2008
In "Can we elect if we cannot compare" (SPAA'03), Barri`ere, Flocchini, Fraigniaud and Santoro consider a qualitative model of distributed computing, where the label...
146
click to vote
WG
2009
Springer
15 years 11 months ago
2009
Springer
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...
149
click to vote
SIGMOD
2005
ACM
15 years 10 months ago
2005
ACM
In this paper, we examine how active database technology developed over the past few years has been put to use to solve real world problems. We note how the technology had to be e...