4966 search results - page 380 / 994 » its 2010 |
231
click to vote
TACAS
2010
Springer
16 years 1 months ago
2010
Springer
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
159
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems including Minimum Fill-i...
165
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
A cellular automaton (CA) is a parallel synchronous computing model, which consists in a juxtaposition of finite automata (cells) whose state evolves according to that of their ne...
170
click to vote
DASFAA
2010
IEEE
16 years 1 months ago
2010
IEEE
Abstract. Despite the recent emergence of many large-scale networks in different application domains, an important measure that captures a participant’s diversity in the network ...
152
click to vote
DCC
2010
IEEE
16 years 1 months ago
2010
IEEE
In this paper, we propose an optimization framework for real-time voice transmission over wireless tandem channels prone to both bit errors and packet erasures. Utilizing a hybrid...