13376 search results - page 276 / 2676 » Problem Solving with |
145
click to vote
CATS
2008
15 years 5 months ago
2008
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
120
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...
112
click to vote
EURODAC
1994
IEEE
15 years 8 months ago
1994
IEEE
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
134
click to vote
WSC
2004
15 years 5 months ago
2004
We present a conceptual framework for validating reusable behavioral models. The setting for this work is a modern product development environment in which design is performed by ...
139
click to vote
QCQC
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and hidden ...