1101 search results - page 68 / 221 » An Algorithm for the Graph Crossing Number Problem |
127
Voted
CPM
2005
Springer
15 years 8 months ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
130
Voted
DIALM
2005
ACM
15 years 4 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
148
click to vote
HICSS
2003
IEEE
15 years 7 months ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
126
Voted
STOC
2006
ACM
16 years 2 months ago
2006
ACM
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
125
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...