5331 search results - page 746 / 1067 » Algebraic Methods for Optimization Problems |
196
click to vote
SSD
2005
Springer
16 years 6 days ago
2005
Springer
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
175
click to vote
ICTAC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Given a nite state machine denoting the speci cation of a system, nding some short interaction sequences capable to reach some/all states or transitions of this machine...
214
click to vote
ALGOSENSORS
2007
Springer
15 years 10 months ago
2007
Springer
We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible n...
183
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...
184
click to vote
CIMAGING
2010
15 years 8 months ago
2010
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...