Sciweavers

102291 search results - page 20179 / 20459
» Computability in Computational Geometry
Sort
View
JNCA
2008
86views more  JNCA 2008»
15 years 6 months ago
Performance comparisons of load balancing algorithms for I/O-intensive workloads on clusters
Load balancing techniques play a critically important role in developing high-performance cluster computing platforms. Existing load balancing approaches are concerned with the ef...
Xiao Qin
JACM
2006
99views more  JACM 2006»
15 years 6 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
JAIR
2006
179views more  JAIR 2006»
15 years 6 months ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert
JAIR
2006
90views more  JAIR 2006»
15 years 6 months ago
Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...
Jörg Hoffmann, Stefan Edelkamp, Sylvie Thi&ea...
JAIR
2006
134views more  JAIR 2006»
15 years 6 months ago
Multi-Issue Negotiation with Deadlines
This paper studies bilateral multi-issue negotiation between self-interested autonomous agents. Now, there are a number of different procedures that can be used for this process; ...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
« Prev « First page 20179 / 20459 Last » Next »