3415 search results - page 135 / 683 » Lower Bounds for Kernelizations |
139
click to vote
MOC
2002
15 years 4 months ago
2002
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...
137
click to vote
ICRA
2008
IEEE
15 years 11 months ago
2008
IEEE
— We propose an inverse agreement control strategy for multiple nonholonomic agents that forces the team members to disperse in the workspace in a distributed manner. Both the ca...
134
click to vote
DCG
1999
15 years 4 months ago
1999
This paper presents a new lower bound of 2:414d= p d on the maximal number of Nash equilibria in d d bimatrix games, a central concept in game theory. The proof uses an equivalent ...
100
click to vote
MSS
2010
IEEE
15 years 2 months ago
2010
IEEE
Overlapping generations are extracting a natural resource over an infinite future. We examine fair allocation of resource and compensations among generations. Fairness is define...
114
click to vote
DCC
2009
IEEE
16 years 5 months ago
2009
IEEE
Kernel machines are a popular class of machine learning algorithms that achieve state of the art accuracies on many real-life classification problems. Kernel perceptrons are among...