6562 search results - page 230 / 1313 » Noetherianity and Combination Problems |
145
click to vote
NOMS
2000
IEEE
15 years 11 months ago
2000
IEEE
Communication networks are expected to offer a wide range of services to an increasingly large number of users, with a diverse range of quality of service. This calls for efficien...
167
click to vote
ACMDIS
2000
ACM
15 years 11 months ago
2000
ACM
Rapid technological change requires that system designers explore potential design spaces widely before committing to a local design space in which to evolve a problem solution. W...
160
click to vote
DAWAK
1999
Springer
15 years 10 months ago
1999
Springer
A Data Warehouse DW can be abstractly seen as a set of materialized views de ned over relations that are stored in distributed heterogeneous databases. The selection of views for...
143
click to vote
CG
1998
Springer
15 years 10 months ago
1998
Springer
Recently, a number of programs have been developed that successfully apply variable-depth search to find solutions for mating problems in Japanese chess, called tsume shogi. Public...
146
click to vote
CP
1997
Springer
15 years 10 months ago
1997
Springer
This paper describes the combination of a well-known tsp heuristic, genius, with a constraint programming model for routing problems. The result, genius-cp, is an e cient heuristic...