Sciweavers

143 search results - page 23 / 29
» On Some Geometric Optimization Problems in Layered Manufactu...
Sort
View
IOR
2007
106views more  IOR 2007»
13 years 7 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
JCT
2011
84views more  JCT 2011»
13 years 2 months ago
Enumerating isodiametric and isoperimetric polygons
For a positive integer n that is not a power of 2, precisely the same family of convex polygons with n sides is optimal in three different geometric problems. These polygons have ...
Michael J. Mossinghoff
TWC
2008
137views more  TWC 2008»
13 years 7 months ago
Reliability and route diversity in wireless networks
Abstract -We study the problem of communication reliability and diversity in multi-hop wireless networks. Our aim is to develop a new network model that better takes into account t...
Amir Ehsan Khandani, Jinane Abounadi, Eytan Modian...
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
14 years 8 months ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat
NIPS
2001
13 years 9 months ago
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
Mikhail Belkin, Partha Niyogi