15485 search results - page 187 / 3097 » Computing Optimal Subsets |
134
click to vote
DATE
2006
IEEE
16 years 12 days ago
2006
IEEE
This paper presents an efficient method to find the optimal intra-task voltage/frequency scheduling for single tasks in practical real-time systems using statistical workload in...
179
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
185
click to vote
EPS
1998
Springer
15 years 10 months ago
1998
Springer
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel ...
164
click to vote
ICA
2007
Springer
15 years 10 months ago
2007
Springer
Deriving a thematically meaningful partition of an unlabeled document corpus is a challenging task. In this context, the use of document representations based on latent thematic ge...