Sciweavers

3049 search results - page 167 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
ICCAD
2007
IEEE
160views Hardware» more  ICCAD 2007»
16 years 3 months ago
Approximation algorithm for the temperature-aware scheduling problem
— The paper addresses the problem of performance optimization for a set of periodic tasks with discrete voltage/frequency states under thermal constraints. We prove that the prob...
Sushu Zhang, Karam S. Chatha
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
16 years 6 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
TACAS
2010
Springer
342views Algorithms» more  TACAS 2010»
16 years 1 months ago
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
Janusz Malinowski, Peter Niebert
ESA
2006
Springer
108views Algorithms» more  ESA 2006»
15 years 10 months ago
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
We consider FIFO buffer management for switches providing differentiated services. In each time step, an arbitrary number of packets arrive, and only one packet can be sent. The bu...
Matthias Englert, Matthias Westermann
RECOMB
2006
Springer
16 years 6 months ago
Maximal Accurate Forests from Distance Matrices
Abstract. We present a fast converging method for distance-based phylogenetic inference, which is novel in two respects. First, it is the only method (to our knowledge) to guarante...
Constantinos Daskalakis, Cameron Hill, Alexander J...