1450 search results - page 141 / 290 » Fitness Uniform Optimization |
166
click to vote
INFOCOM
2007
IEEE
16 years 2 days ago
2007
IEEE
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...
208
click to vote
CPM
2004
Springer
15 years 11 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
156
click to vote
VLDB
1989
ACM
15 years 9 months ago
1989
ACM
: We describe the architecture of a relational databasesystem that is extensible by user-defined data types and operations, including relation operations. The central concept is to...
183
click to vote
ESA
2000
Springer
15 years 9 months ago
2000
Springer
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
166
click to vote
NIPS
2001
15 years 7 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...