13987 search results - page 332 / 2798 » The Two Guards Problem |
293
click to vote
ICDE
1995
IEEE
16 years 8 months ago
1995
IEEE
We address the problem of providing integrated access to diverse and dynamic information sources. We explain how this problem di ers from the traditional database integration probl...
171
click to vote
WG
2009
Springer
16 years 1 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...
178
click to vote
ICTAI
2008
IEEE
16 years 1 months ago
2008
IEEE
The Web Service Composition (WSC) problem on behavioral descriptions deals with the automatic construction of a coordinator web service to control a set of web services to reach t...
174
click to vote
CEC
2003
IEEE
16 years 1 days 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 ...
169
click to vote
HICSS
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper we consider the complete supply chain for a large pulp producer in Sweden. The supply chain is divided up in two parts, the pulp production planning problem and the ...