Sciweavers

1165 search results - page 24 / 233
» Effective linear programming based placement methods
Sort
View
SODA
1998
ACM
114views Algorithms» more  SODA 1998»
13 years 9 months ago
Exact Arithmetic at Low Cost - A Case Study in Linear Programming
We describe a new exact-arithmetic approach to linear programming when the number of variables n is much larger than the number of constraints m (or vice versa). The algorithm is ...
Bernd Gärtner
EMNLP
2009
13 years 6 months ago
Adapting a Polarity Lexicon using Integer Linear Programming for Domain-Specific Sentiment Classification
Polarity lexicons have been a valuable resource for sentiment analysis and opinion mining. There are a number of such lexical resources available, but it is often suboptimal to us...
Yejin Choi, Claire Cardie
COR
2011
13 years 3 months ago
Faster integer-feasibility in mixed-integer linear programs by branching to force change
Branching in mixed-integer (or integer) linear programming requires choosing both the branching variable and the branching direction. This paper develops a number of new methods f...
Jennifer Pryor, John W. Chinneck
CLUSTER
2007
IEEE
14 years 2 months ago
Effects of packet pacing for MPI programs in a Grid environment
— Improving the performance of TCP communication is the key to the successful deployment of MPI programs in a Grid environment in which multiple clusters are connected through hi...
Ryousei Takano, Motohiko Matsuda, Tomohiro Kudoh, ...
CP
2005
Springer
14 years 2 months ago
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter