519 search results - page 66 / 104 » A New Approach to Strongly Polynomial Linear Programming |
145
click to vote
CEC
2010
IEEE
14 years 5 months ago
2010
IEEE
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
118
click to vote
DFG
2009
Springer
15 years 8 months ago
2009
Springer
s of the work of our research group are given in the following poster of the final meeting. Network Coding Network Coding has emerged as a new paradigm that has influenced Inform...
125
click to vote
WEA
2010
Springer
15 years 8 months ago
2010
Springer
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present ...
102
click to vote
APPROX
2009
Springer
15 years 8 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
135
click to vote
NIPS
2003
15 years 2 months ago
2003
In typical classification tasks, we seek a function which assigns a label to a single object. Kernel-based approaches, such as support vector machines (SVMs), which maximize the ...