Sciweavers

1722 search results - page 255 / 345
» Generating Tests from Counterexamples
Sort
View
ICALP
2009
Springer
14 years 9 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
SIGIR
2005
ACM
14 years 2 months ago
Linear discriminant model for information retrieval
This paper presents a new discriminative model for information retrieval (IR), referred to as linear discriminant model (LDM), which provides a flexible framework to incorporate a...
Jianfeng Gao, Haoliang Qi, Xinsong Xia, Jian-Yun N...
EMSOFT
2005
Springer
14 years 2 months ago
Model-based run-time monitoring of end-to-end deadlines
The correct interplay among components in a distributed, reactive system is a crucial development task, particularly for embedded systems such as those in the automotive domain. M...
Jaswinder Ahluwalia, Ingolf H. Krüger, Walter...
GECCO
2005
Springer
155views Optimization» more  GECCO 2005»
14 years 2 months ago
Mission planning for joint suppression of enemy air defenses using a genetic algorithm
In this paper we present a genetic algorithm applied to the problem of mission planning for Joint Suppression of Enemy Air Defenses (JSEAD) in support of air strike operations. Th...
Jeffrey P. Ridder, Jason C. HandUber
LCN
2002
IEEE
14 years 2 months ago
A User Level Framework for Ad Hoc Routing
The availability of inexpensive wireless networking hardware (e.g., based on the IEEE 802.11 standards) has generated interest in a large class of wireless applications. Many appl...
Jérémie Allard, Paul Gonin, Minoo Si...