299 search results - page 49 / 60 » Optimizing Polynomial Solvers for Minimal Geometry Problems |
96
Voted
INFOCOM
2006
IEEE
15 years 6 months ago
2006
IEEE
— We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically fail to detect attacks and also gener...
IJCAI
2003
15 years 1 months ago
2003
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
SPAA
2003
ACM
15 years 5 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
97
Voted
CADE
2006
Springer
16 years 22 days ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
143
click to vote
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
— The problem of placing an arbitrary subset (m) of the (n) closed loop eigenvalues of a nth order continuous time single input linear time invariant(LTI) system, using full stat...