3359 search results - page 404 / 672 » A Simplified Idea Algorithm |
111
click to vote
MFCS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
121
Voted
GIAE
2004
Springer
15 years 6 months ago
2004
Springer
In this paper, we propose the wireframe representation of nD object, which is a single 2D line drawing. A wireframe model of an nD object is composed of a set of edges connecting a...
113
click to vote
MFCS
2004
Springer
15 years 6 months ago
2004
Springer
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
121
Voted
MIDDLEWARE
2004
Springer
15 years 6 months ago
2004
Springer
Data grids, large scale web applications generating dynamic content and database service providing pose significant scalability challenges to database engines. Replication is the ...
107
click to vote
PPSN
2004
Springer
15 years 6 months ago
2004
Springer
Two ideas taken from Bayesian optimization and classifier systems are presented for personnel scheduling based on choosing a suitable scheduling rule from a set for each person’s...