1650 search results - page 173 / 330 » The HOM problem is decidable |
141
click to vote
CONCUR
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Delaying the synchronization of actions may reveal some hidden behavior that would not happen if the synchronization met the specified deadlines. This precise phenomenon...
139
click to vote
COCOON
2008
Springer
15 years 6 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
127
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic p...
136
click to vote
FORMATS
2008
Springer
15 years 6 months ago
2008
Springer
Metric Temporal Logic (MTL) is a widely-studied real-time extension of Linear Temporal Logic. In this paper we survey results about the complexity of the satisfiability and model c...
162
click to vote
EDM
2010
15 years 6 months ago
2010
One of the main problems faced by university students is deciding the right learning path based on available information such as courses, schedules and professors. In this context,...