427 search results - page 38 / 86 » A Subexponential Bound for Linear Programming |
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
SPAA
2004
ACM
14 years 1 months ago
2004
ACM
A key capability of data-race detectors is to determine whether one thread executes logically in parallel with another or whether the threads must operate in series. This paper pr...
HYBRID
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. An algorithm for computing the maximal controlled invariant set and the least restrictive controller for discrete time systems is proposed. We show how the algorithm can ...
CDC
2009
IEEE
14 years 13 days ago
2009
IEEE
— Global asymptotic stabilization for a class of nonlinear systems is addressed. The dynamics of these systems are composed of a linear part to which is added some nonlinearities...