Sciweavers

365 search results - page 16 / 73
» Local Computation Schemes with Partially Ordered Preferences
Sort
View
MEMOCODE
2008
IEEE
14 years 2 months ago
Virtual prototyping AADL architectures in a polychronous model of computation
While synchrony and asynchrony are two distinct concepts of concurrency theory, effective and formally defined embedded system design methodologies usually mix the best from both...
Ma Yue, Jean-Pierre Talpin, Thierry Gautier
ISW
2000
Springer
14 years 1 days ago
A Signcryption Scheme Based on Integer Factorization
Abstract. Signcryption is a public-key cryptographic primitive introduced by Zheng, which achieves both message confidentiality and nonrepudiatable origin authenticity, at a lower ...
Ron Steinfeld, Yuliang Zheng
CP
2004
Springer
14 years 1 months ago
Counting-Based Look-Ahead Schemes for Constraint Satisfaction
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
Kalev Kask, Rina Dechter, Vibhav Gogate
GD
2003
Springer
14 years 1 months ago
Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes
In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same node set. We present three algorithms...
Cesim Erten, Stephen G. Kobourov, Vu Le, Armand Na...
MOBICOM
2009
ACM
14 years 3 months ago
Scheduling partition for order optimal capacity in large-scale wireless networks
The capacity scaling property specifies the changes in network throughput when network size increases and serves as an essential performance evaluation metric for large-scale wir...
Yi Xu, Wenye Wang