1277 search results - page 74 / 256 » Terminating Decision Algorithms Optimally |
137
Voted
VLDB
1997
ACM
15 years 7 months ago
1997
ACM
Selecting views to materialize is one of the most important decisions in designing a data warehouse. In this paper, we present a framework for analyzing the issues in selecting vi...
114
click to vote
JAIR
2008
15 years 3 months ago
2008
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
129
Voted
SCP
1998
15 years 2 months ago
1998
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...
113
click to vote
ICONIP
2009
15 years 29 days ago
2009
There is an ever increasing number of electronic documents available today and the task of organizing and categorizing this ever growing corpus of electronic documents has become t...
114
click to vote
SPDP
1993
IEEE
15 years 7 months ago
1993
IEEE
In this paper, we propose a new parallel genetic alge rithm (GA), called Extended Distributed Genetic Algorithm (EDGA), for channel routing problem. The EDGA combines the advantag...