1277 search results - page 24 / 256 » Terminating Decision Algorithms Optimally |
109
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
130
click to vote
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
This work presents a best-first anytime algorithm for computing optimal coalition structures. The approach is novel in that it generates coalition structures based on coalition va...
122
click to vote
ICNP
1999
IEEE
15 years 7 months ago
1999
IEEE
The design of software-based algorithms for fast IP address lookup targeted for general purpose processors has received tremendous attention in recent years due to its low cost im...
115
click to vote
WECWIS
2002
IEEE
15 years 7 months ago
2002
IEEE
How to conduct automated business negotiation over the Internet is an important issue for agent research. In most bilateral negotiation models, two negotiation agents negotiate by...
131
click to vote
EMO
2006
Springer
15 years 6 months ago
2006
Springer
With the popularity of efficient multi-objective evolutionary optimization (EMO) techniques and the need for such problem-solving activities in practice, EMO methodologies and EMO ...