4860 search results - page 149 / 972 » SNPs Problems, Complexity, and Algorithms |
106
Voted
CORR
2007
Springer
15 years 2 months ago
2007
Springer
The ubiquity of modular structure in real-world complex networks is being the focus of attention in many trials to understand the interplay between network topology and functionali...
139
click to vote
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
119
click to vote
COCO
2010
Springer
15 years 6 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
140
click to vote
HPCC
2007
Springer
15 years 9 months ago
2007
Springer
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...
118
click to vote
ECML
1993
Springer
15 years 7 months ago
1993
Springer
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...