2714 search results - page 147 / 543 » Approximation Schemes for Scheduling |
103
click to vote
ICALP
1998
Springer
15 years 5 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
108
click to vote
JDA
2008
15 years 22 days ago
2008
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...
90
Voted
CDC
2008
IEEE
15 years 7 months ago
2008
IEEE
— In this paper an approach to reduce nonlinear non-observable and non-strongly accessible port-Hamiltonian systems to an observable and strongly accessible portHamiltonian syste...
118
Voted
ISIPTA
2005
IEEE
15 years 6 months ago
2005
IEEE
Graph-theoretical representations for sets of probability measures (credal networks) generally display high complexity, and approximate inference seems to be a natural solution fo...
87
Voted
CG
2006
Springer
15 years 25 days ago
2006
Springer
In this paper we consider the novel idea of closest feature maps (CFMs) applied to refinable collision response in order to address the potential issues and problems associated wi...