Sciweavers

1333 search results - page 93 / 267
» Not a Number of Floating Point Problems
Sort
View
127
Voted
ICRA
2008
IEEE
117views Robotics» more  ICRA 2008»
15 years 10 months ago
Tracking hidden agents through shadow information spaces
— This paper addresses problems of inferring the locations of moving agents from combinatorial data extracted by robots that carry sensors. The agents move unpredictably and may ...
Jingjin Yu, Steven M. LaValle
135
Voted
IFIP
2005
Springer
15 years 9 months ago
On Warm Starts for Interior Methods
An appealing feature of interior methods for linear programming is that the number of iterations required to solve a problem tends to be relatively insensitive to the choice of in...
Anders Forsgren
118
Voted
FPL
2003
Springer
128views Hardware» more  FPL 2003»
15 years 9 months ago
Case Study of a Functional Genomics Application
Although microarrays are already having a tremendous impact on biomedical science, they still present great computational challenges. We examine a particular problem involving the...
Tom Van Court, Martin C. Herbordt, Richard J. Bart...
142
Voted
AMC
2006
107views more  AMC 2006»
15 years 3 months ago
Linear bilevel programming with upper level constraints depending on the lower level solution
Focus in the paper is on the definition of linear bilevel programming problems, the existence of optimal solutions and necessary as well as sufficient optimality conditions. In th...
Ayalew Getachew Mersha, Stephan Dempe
171
Voted
MLDM
2010
Springer
14 years 10 months ago
Fast Algorithms for Constant Approximation k-Means Clustering
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
Mingjun Song, Sanguthevar Rajasekaran