10608 search results - page 265 / 2122 » Complexity of O'Hara's Algorithm |
108
Voted
IAT
2006
IEEE
15 years 6 months ago
2006
IEEE
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
104
Voted
DLT
2003
15 years 1 months ago
2003
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
88
Voted
IWINAC
2007
Springer
15 years 6 months ago
2007
Springer
One of the key points in Estimation of Distribution Algorithms (EDAs) is the learning of the probabilistic graphical model used to guide the search: the richer the model the more ...
115
Voted
ATAL
2005
Springer
15 years 6 months ago
2005
Springer
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
109
Voted
KBSE
1997
IEEE
15 years 4 months ago
1997
IEEE
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially whe...