Sciweavers

2354 search results - page 89 / 471
» Tracking Stopping Times
Sort
View
ISSAC
2007
Springer
121views Mathematics» more  ISSAC 2007»
16 years 14 days ago
A comparative analysis of parallel disk-based Methods for enumerating implicit graphs
It is only in the last five years that researchers have begun to use disk-based search techniques on a large scale. The primary examples of its use come from symbolic algebra and...
Eric Robinson, Daniel Kunkle, Gene Cooperman
ISCC
2006
IEEE
256views Communications» more  ISCC 2006»
16 years 10 days ago
A Wireless Distributed Intrusion Detection System and a New Attack Model
Denial-of-Service attacks, and jamming in particular, are a threat to wireless networks because they are at the same time easy to mount and difficult to detect and stop. We propo...
Marco Domenico Aime, Giorgio Calandriello, Antonio...
AMAST
2004
Springer
15 years 11 months ago
Separate Compositional Analysis of Class-Based Object-Oriented Languages
Abstract. We present a separate compositional analysis for objectoriented languages. We show how a generic static analysis of a context that uses an object can be split into two se...
Francesco Logozzo
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
15 years 11 months ago
Solving Geometric Covering Problems by Data Reduction
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
Steffen Mecke, Dorothea Wagner
ISAAC
2003
Springer
125views Algorithms» more  ISAAC 2003»
15 years 11 months ago
A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...
Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhof...