1729 search results - page 217 / 346 » On Bounds for the k-Partitioning of Graphs |
152
click to vote
IEEEPACT
1998
IEEE
15 years 10 months ago
1998
IEEE
In order to achieve practical efficient execution on a parallel architecture, a knowledge of the data dependencies related to the application appears as the key point for building...
172
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag m...
157
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
Message Sequence Charts (MSCs) are an attractive visual formalism widely used to capture system requirements during the early design stages in domains such as telecommunication sof...
182
click to vote
COR
2010
15 years 6 months ago
2010
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
173
click to vote
CN
2008
15 years 6 months ago
2008
The connectivity of the Internet crucially depends on the relationships between thousands of Autonomous Systems (ASes) that exchange routing information using the Border Gateway P...