Sciweavers

635 search results - page 51 / 127
» Path Optimization in Programs and Its Application to Debuggi...
Sort
View
SIAMJO
2008
84views more  SIAMJO 2008»
15 years 3 months ago
Regularity Conditions via Quasi-Relative Interior in Convex Programming
We give some new regularity conditions for Fenchel duality in separated locally convex vector spaces, written in terms of the notion of quasi interior and quasi-relative interior, ...
Radu Ioan Bot, Ernö Robert Csetnek, Gert Wank...
MOR
2002
94views more  MOR 2002»
15 years 2 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
GECCO
2010
Springer
196views Optimization» more  GECCO 2010»
15 years 8 months ago
Using synthetic test suites to empirically compare search-based and greedy prioritizers
The increase in the complexity of modern software has led to the commensurate growth in the size and execution time of the test suites for these programs. In order to address this...
Zachary D. Williams, Gregory M. Kapfhammer
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
15 years 9 months ago
Constant Factor Approximations for the Hotlink Assignment Problem
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
Tobias Jacobs
SENSYS
2004
ACM
15 years 8 months ago
A sensor network application construction kit (SNACK)
We propose a new configuration language, component and service library, and compiler that make it easier to develop efficient sensor network applications. Our goal is the constr...
Ben Greenstein, Eddie Kohler, Deborah Estrin