1182 search results - page 145 / 237 » Iterative Methods in Combinatorial Optimization |
88
Voted
ISQED
2010
IEEE
15 years 9 months ago
2010
IEEE
— Timing exceptions in IC implementation processes, especially timing verification, help reduce pessimism that arises from unnecessary timing constraints by masking non-function...
117
Voted
SIAMSC
2010
15 years 1 months ago
2010
We propose a fast algorithm for solving the ℓ1-regularized minimization problem minx∈Rn µ x 1 + Ax − b 2 2 for recovering sparse solutions to an undetermined system of linea...
173
Voted
STOC
2007
ACM
16 years 2 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
135
Voted
EDBTW
2010
Springer
15 years 1 months ago
2010
Springer
Due to the growing importance of the World Wide Web, archiving it has become crucial for preserving useful source of information. To maintain a web archive up-to-date, crawlers ha...
156
Voted
ISSRE
2003
IEEE
15 years 8 months ago
2003
IEEE
Component based software development is prone to unexpected interaction faults. The goal is to test as many potential interactions as is feasible within time and budget constraint...