Sciweavers

191 search results - page 36 / 39
» Time Efficient Gossiping in Known Radio Networks
Sort
View
CODES
2010
IEEE
14 years 9 months ago
Improving platform-based system synthesis by satisfiability modulo theories solving
Due to the ever increasing system complexity, deciding whether a given platform is sufficient to implement a set of applications under given constraints becomes a serious bottlene...
Felix Reimann, Michael Glaß, Christian Haube...
97
Voted
JSA
2000
115views more  JSA 2000»
14 years 11 months ago
Scheduling optimization through iterative refinement
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
Mayez A. Al-Mouhamed, Adel Al-Massarani
ANCS
2007
ACM
15 years 3 months ago
Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia
The importance of network security has grown tremendously and a collection of devices have been introduced, which can improve the security of a network. Network intrusion detectio...
Sailesh Kumar, Balakrishnan Chandrasekaran, Jonath...
ICNP
1999
IEEE
15 years 3 months ago
Automated Protocol Implementations Based on Activity Threads
In this paper we present a new approach for the automated mapping of formal descriptions into activity thread implementations. Our approach resolves semantic conflicts by reorderi...
Peter Langendörfer, Hartmut König
AI
2008
Springer
14 years 11 months ago
Modelling and solving temporal reasoning as propositional satisfiability
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
Duc Nghia Pham, John Thornton, Abdul Sattar