Sciweavers

5372 search results - page 983 / 1075
» complexity 2007
Sort
View
JSYML
2007
100views more  JSYML 2007»
15 years 3 months ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore
JUCS
2007
95views more  JUCS 2007»
15 years 3 months ago
Using Place Invariants and Test Point Placement to Isolate Faults in Discrete Event Systems
: This paper describes a method of using Petri net P-invariants in system diagnosis. To model this process a net oriented fault classification is presented. Hence, the considered d...
Iwan Tabakow
JUCS
2007
93views more  JUCS 2007»
15 years 3 months ago
Quality of Service Routing in a MANET with OLSR
: Ad hoc wireless networks have enormous commercial and military potential because of their self-organizing capacity and mobility support. However, some specificities of these net...
Dang-Quan Nguyen, Pascale Minet
KBS
2007
74views more  KBS 2007»
15 years 3 months ago
Representation and processing of information related to real world events
Event based analysis plays an important role in reducing the latency of information delivery in an event driven world. Also, the perception of an ‘event’ by a user is at a hig...
Aparna Nagargadde, V. Sridhar, Krithi Ramamritham
ALGORITHMICA
2002
97views more  ALGORITHMICA 2002»
15 years 3 months ago
Testing and Spot-Checking of Data Streams
Abstract. We consider the tasks of testing and spot-checking for data streams. These testers and spotcheckers are potentially useful in real-time or near real-time applications tha...
Joan Feigenbaum, Sampath Kannan, Martin Strauss, M...