288 search results - page 10 / 58 » Notes on computing minimal approximant bases |
ADHOCNOW
2009
Springer
13 years 11 months ago
2009
Springer
We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the lin...
SWAT
2004
Springer
14 years 3 months ago
2004
Springer
We consider the speed scaling problem of minimizing the average response time of a collection of dynamically released jobs subject to a constraint A on energy used. We propose an ...
DLT
2007
13 years 11 months ago
2007
Abstract. We investigate the state complexity of union and intersection for finite languages. Note that the problem of obtaining the tight bounds for both operations was open. We ...
ICCAD
2003
IEEE
14 years 6 months ago
2003
IEEE
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
SENSYS
2006
ACM
14 years 3 months ago
2006
ACM
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...