585 search results - page 92 / 117 » Better Abstractions for Timed Automata |
CORR
2006
Springer
15 years 15 days ago
2006
Springer
Abstract-- An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes a...
97
Voted
JCP
2008
15 years 13 days ago
2008
Abstract--Scheduling algorithm for batch-mode dataintensive jobs is a key issue in data-intensive Grid applications. It focuses on how to minimize the overhead of transferring the ...
98
Voted
TAP
2008
Springer
15 years 11 days ago
2008
Springer
Abstract. In recent years, we see a growing awareness to the importance of assessing the quality of specifications. In the context of model checking, this can be done by analyzing ...
95
Voted
TKDE
2008
15 years 11 days ago
2008
Abstract-- With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customer...
121
Voted
JUCS
2007
15 years 10 days ago
2007
Abstract: The technology in the field of digital media generates huge amounts of textual information every day, so mechanisms to retrieve relevant information are needed. Under th...