Sciweavers

1568 search results - page 144 / 314
» The problem of examination questions in algorithmics
Sort
View
RTS
2008
134views more  RTS 2008»
15 years 3 months ago
On earliest deadline first scheduling for temporal consistency maintenance
A real-time object is one whose state may become invalid with the passage of time. A temporal validity interval is associated with the object state, and the real-time object is te...
Ming Xiong, Qiong Wang, Krithi Ramamritham
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
16 years 6 months ago
Closest-Point-of-Approach Join for Moving Object Histories
In applications that produce a large amount of data describing the paths of moving objects, there is a need to ask questions about the interaction of objects over a long recorded ...
Subramanian Arumugam, Chris Jermaine
ISDA
2009
IEEE
15 years 11 months ago
Measures for Unsupervised Fuzzy-Rough Feature Selection
For supervised learning, feature selection algorithms attempt to maximise a given function of predictive accuracy. This function usually considers the ability of feature vectors t...
Neil MacParthalain, Richard Jensen
BIRTHDAY
2005
Springer
15 years 10 months ago
Synthesis Revisited: Generating Statechart Models from Scenario-Based Requirements
Constructing a program from a specification is a long-known general and fundamental problem. Besides its theoretical interest, this question also has practical implications, since...
David Harel, Hillel Kugler, Amir Pnueli
WABI
2004
Springer
107views Bioinformatics» more  WABI 2004»
15 years 10 months ago
Phylogenetic Super-networks from Partial Trees
—In practice, one is often faced with incomplete phylogenetic data, such as a collection of partial trees or partial splits. This paper poses the problem of inferring a phylogene...
Daniel H. Huson, Tobias Dezulian, Tobias H. Kl&oum...