2957 search results - page 539 / 592 » The Complexity of Polynomial-Time Approximation |
EMSOFT
2007
Springer
14 years 1 months ago
2007
Springer
Most recent embedded systems use caches to improve their average performance. Current timing analyses are able to compute safe timing guarantees for these systems, if tasks are ru...
SEMWEB
2007
Springer
14 years 1 months ago
2007
Springer
Millions of research funding has been put down to develop - what I call - old forms - of reasoning that are characterized by strong focus on theoretical properties and strict adher...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
ACSC
2006
IEEE
14 years 1 months ago
2006
IEEE
Modern computer networks contain an amalgamation of devices and technologies, with the performance exhibited by each central to digital communications. Varieties of methods exist ...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
— Recently, Rao-Blackwellized particle filters have become a popular tool to solve the simultaneous localization and mapping problem. This technique applies a particle filter i...