Sciweavers

79 search results - page 3 / 16
» A decomposition procedure based on approximate Newton direct...
Sort
View
EOR
2006
87views more  EOR 2006»
13 years 9 months ago
Applying machine based decomposition in 2-machine flow shops
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedu...
Saral Mukherjee, A. K. Chatterjee
LICS
2003
IEEE
14 years 3 months ago
New Directions in Instantiation-Based Theorem Proving
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We gi...
Harald Ganzinger, Konstantin Korovin
INFOCOM
2012
IEEE
12 years 6 days ago
Approximate convex decomposition based localization in wireless sensor networks
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...
Wenping Liu, Dan Wang, Hongbo Jiang, Wenyu Liu, Ch...
AROBOTS
2007
128views more  AROBOTS 2007»
13 years 10 months ago
Visual homing in environments with anisotropic landmark distribution
Gradient descent in image distances can lead a navigating agent to the goal location, but in environments with an anisotropic distribution of landmarks, gradient home vectors devia...
Ralf Möller, Andrew Vardy, Sven Kreft, Sebast...
NIPS
2004
13 years 11 months ago
A Direct Formulation for Sparse PCA Using Semidefinite Programming
We examine the problem of approximating, in the Frobenius-norm sense, a positive, semidefinite symmetric matrix by a rank-one matrix, with an upper bound on the cardinality of its...
Alexandre d'Aspremont, Laurent El Ghaoui, Michael ...