Sciweavers

1215 search results - page 161 / 243
» Application domain study of evolutionary algorithms in optim...
Sort
View
SAC
2004
ACM
15 years 6 months ago
A robust deception-free coalition formation model
We study two properties of coalition formation algorithms, very important for their application in real-life scenarios: robustness and tolerance to some agent misbehaviors. The st...
María-Victoria Belmonte, Ricardo Conejo, Jo...
JACM
2006
99views more  JACM 2006»
15 years 1 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
CORR
2007
Springer
104views Education» more  CORR 2007»
15 years 1 months ago
Sorting and Selection in Posets
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
Constantinos Daskalakis, Richard M. Karp, Elchanan...
SCHOLARPEDIA
2011
14 years 4 months ago
N-body simulations
Abstract. Scientists’ ability to generate and collect massive-scale datasets is increasing. As a result, constraints in data analysis capability rather than limitations in the av...
JPDC
2006
103views more  JPDC 2006»
15 years 1 months ago
Fractal: A mobile code-based framework for dynamic application protocol adaptation
The rapid growth of heterogeneous devices and diverse networks in our daily life, makes it is very difficult, if not impossible, to build a one-size-fits-all application or protoc...
Hanping Lufei, Weisong Shi