15033 search results - page 260 / 3007 » Complexity Theory and Algorithms |
154
click to vote
TSP
2010
14 years 11 months ago
2010
Abstract--In this paper, we deal with the problem of constrained code optimization for radar space-time adaptive processing (STAP) in the presence of colored Gaussian disturbance. ...
137
click to vote
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
144
click to vote
IPSN
2003
Springer
15 years 10 months ago
2003
Springer
Sensor networks have emerged as a fundamentally new tool for monitoring spatially distributed phenomena. This paper investigates a strategy by which sensor nodes detect and estima...
111
click to vote
IFIP
1994
Springer
15 years 9 months ago
1994
Springer
The aim of this discussion paper is to stimulate (or perhaps to provoke) stronger interactions among theoreticians and practitioners interested in efficient problem solutions. We ...
132
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. By introducing the Regular Membership Constraint, Gilles Pesant pioneered the idea of basing constraints on formal languages. The paper presented here is highly motivated...