1158 search results - page 208 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
OPODIS
2004
15 years 12 days ago
2004
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the t...
IJCAI
1993
15 years 11 days ago
1993
One of the open problems listed in Rivest and Schapire, 1989] is whether and how that the copies of L in their algorithm can be combined into one for better performance. This pape...
117
click to vote
AAAI
2010
15 years 15 days ago
2010
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...
87
Voted
SIROCCO
2010
15 years 14 days ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
94
Voted
AAAI
2007
15 years 1 months ago
2007
Recent work on online auctions for digital goods has explored the role of optimal stopping theory — particularly secretary problems — in the design of approximately optimal on...