Sciweavers

585 search results - page 52 / 117
» Better Abstractions for Timed Automata
Sort
View
ANOR
2010
135views more  ANOR 2010»
15 years 20 days ago
A framework of irregularity enlightenment for data pre-processing in data mining
Abstract Irregularities are widespread in large databases and often lead to erroneous conclusions with respect to data mining and statistical analysis. For example, considerable bi...
Siu-Tong Au, Rong Duan, Siamak G. Hesar, Wei Jiang
122
Voted
FM
2005
Springer
156views Formal Methods» more  FM 2005»
15 years 6 months ago
Testing Concurrent Object-Oriented Systems with Spec Explorer
Abstract Colin Campbell, Wolfgang Grieskamp, Lev Nachmanson, Wolfram Schulte, Nikolai Tillmann, and Margus Veanes Microsoft Research, Redmond, WA, USA Abstract. We describe a pract...
Colin Campbell, Wolfgang Grieskamp, Lev Nachmanson...
98
Voted
IEEECIT
2010
IEEE
14 years 11 months ago
Application of Concept Maps-based Anchored Instruction in Programming Course
—In need of interesting material and effective teaching approach in programming learning, students were ely to drop out of the course for the abstract concepts and complex struct...
Liu Li, Haijun Mao, Licheng Xu
ALGOSENSORS
2009
Springer
15 years 3 months ago
Routing on Delay Tolerant Sensor Networks
Abstract. Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possib...
Michael Keane, Evangelos Kranakis, Danny Krizanc, ...
81
Voted
IANDC
2007
84views more  IANDC 2007»
15 years 14 days ago
The perfectly synchronized round-based model of distributed computing
ectly-synchronized round-based model provides the powerful abstraction of op failures with atomic and synchronous message delivery. This abstraction makes distributed programming ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...