Sciweavers

716 search results - page 61 / 144
» Semilinear Program Feasibility
Sort
View
CP
2004
Springer
15 years 3 months ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker
DAC
2008
ACM
15 years 10 months ago
Concurrent topology and routing optimization in automotive network integration
In this paper, a novel automatic approach for the concurrent topology and routing optimization that achieves a high quality network layout is proposed. This optimization is based ...
Bardo Lang, Christian Haubelt, Jürgen Teich, ...
SODA
2010
ACM
155views Algorithms» more  SODA 2010»
15 years 7 months ago
A Space--Time Tradeoff for Permutation Problems
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
Mikko Koivisto, Pekka Parviainen
ICRA
2005
IEEE
145views Robotics» more  ICRA 2005»
15 years 3 months ago
Computation and Graphical Characterization of Robust Multiple-Contact Postures in 2D Gravitational Environments
— This paper is concerned with the problem of identifying robust equilibrium postures of a planar mechanism supported by fixed frictional contacts in a twodimensional gravitation...
Yizhar Or, Elon Rimon
FPL
2007
Springer
99views Hardware» more  FPL 2007»
15 years 1 months ago
Disjoint Pattern Enumeration for Custom Instructions Identification
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. These custom instructions are selected through an analys...
Pan Yu, Tulika Mitra