Sciweavers

466 search results - page 68 / 94
» Preprocessing Search Spaces for Branch and Bound Search
Sort
View
LCTRTS
1995
Springer
15 years 9 months ago
Scheduling of Hard Aperiodic Tasks in Hybrid Static/Dynamic Priority Systems
In this paper, we present a preemptive joint scheduling of hard deadline periodic and hard deadline aperiodic tasks on a uniprocessor real-time system. The scheduling has extended...
Jongwon Lee, Sungyoung Lee, Hyungill Kim
DBA
2006
236views Database» more  DBA 2006»
15 years 7 months ago
Quantizing Time Series for Efficient Subsequence Matching
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data ...
Inés Fernando Vega López, Bongki Moo...
AIPS
2008
15 years 8 months ago
Fast Planning for Dynamic Preferences
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
Brian Ziebart, Anind K. Dey, J. Andrew Bagnell
ICSE
2007
IEEE-ACM
16 years 6 months ago
Korat: A Tool for Generating Structurally Complex Test Inputs
This paper describes the Korat tool for constraint-based generation of structurally complex test inputs for Java programs. Korat takes (1) an imperative predicate that specifies t...
Aleksandar Milicevic, Sasa Misailovic, Darko Marin...
ICFEM
2009
Springer
16 years 17 days ago
A Lazy Unbounded Model Checker for Event-B
Formal specification languages are traditionally supported by theorem provers, but recently model checkers have proven to be useful tools. In this paper we present Eboc, an explic...
Paulo J. Matos, Bernd Fischer, João P. Marq...