Sciweavers

1434 search results - page 94 / 287
» Graph Searching with Advice
Sort
View
FPL
2008
Springer
113views Hardware» more  FPL 2008»
13 years 10 months ago
Mapping and scheduling with task clustering for heterogeneous computing systems
This paper presents a new approach for mapping task graphs to heterogeneous hardware/software computing systems using heuristic search techniques. Two techniques: (1) integration ...
Yuet Ming Lam, José Gabriel F. Coutinho, Wa...
EACL
1993
ACL Anthology
13 years 10 months ago
Disjunctions and Inheritance in the Context Feature Structure System
Substantial efforts have been made in order to cope with disjunctions in constraint based grammar formalisms (e.g. [Kasper, 1987; Maxwell and Kaplan, 1991; DSrre and Eisele, 1990]...
Martin Böttcher
ENDM
2008
93views more  ENDM 2008»
13 years 9 months ago
The Generalized Max-Controlled Set Problem
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
Ivairton M. Santos, Carlos A. J. Martinhon, Luiz S...
SIAMCOMP
2008
78views more  SIAMCOMP 2008»
13 years 8 months ago
I/O-Efficient Planar Separators
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
Anil Maheshwari, Norbert Zeh
HEURISTICS
2008
124views more  HEURISTICS 2008»
13 years 9 months ago
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
Michael Polacek, Karl F. Doerner, Richard F. Hartl...