Sciweavers

489 search results - page 32 / 98
» Formulations and Reformulations in Integer Programming
Sort
View
4OR
2010
148views more  4OR 2010»
13 years 6 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini
IEEECIT
2006
IEEE
14 years 1 months ago
ILP-based Scheduling for Asynchronous Circuits in Bundled-Data Implementation
In this paper, we propose a new scheduling method for asynchronous circuits in bundled-data implementation. The method is based on integer linear programming (ILP) which explores ...
Hiroshi Saito, Nattha Jindapetch, Tomohiro Yoneda,...
JNW
2006
98views more  JNW 2006»
13 years 7 months ago
Efficient Distributed Algorithm for RWA Using Path Protection
A number of Integer Linear Program (ILP) formulations for both static and dynamic lightpath allocation have been proposed, for the design of survivable WDM networks. However, such ...
Arunita Jaekel, Ying Chen
ECIR
2007
Springer
13 years 9 months ago
A Study of Global Inference Algorithms in Multi-document Summarization
Abstract. In this work we study the theoretical and empirical properties of various global inference algorithms for multi-document summarization. We start by defining a general fr...
Ryan T. McDonald
ACCV
2007
Springer
13 years 9 months ago
A Convex Programming Approach to the Trace Quotient Problem
Abstract. The trace quotient problem arises in many applications in pattern classification and computer vision, e.g., manifold learning, low-dimension embedding, etc. The task is ...
Chunhua Shen, Hongdong Li, Michael J. Brooks