Sciweavers

1174 search results - page 15 / 235
» Optimizing generics is easy!
Sort
View
MOR
2002
94views more  MOR 2002»
13 years 9 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
ISVLSI
2003
IEEE
118views VLSI» more  ISVLSI 2003»
14 years 3 months ago
Networks-On-Chip: The Quest for On-Chip Fault-Tolerant Communication
In this paper, we discuss the possibility of achieving onchip fault-tolerant communication based on a new communication paradigm called stochastic communication. Specifically, for...
Radu Marculescu
CRYPTO
2011
Springer
232views Cryptology» more  CRYPTO 2011»
12 years 9 months ago
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
Structure-preserving signatures are signatures defined over bilinear groups that rely on generic group operations. In particular, the messages and signatures consist of group elem...
Masayuki Abe, Jens Groth, Kristiyan Haralambiev, M...
WDAG
2000
Springer
111views Algorithms» more  WDAG 2000»
14 years 1 months ago
Thrifty Generic Broadcast
Weconsider the problemof generic broadcast in asynchronous systems with crashes, a problem that was rst studied in 12]. Roughly speaking, given a \con ict" relation on the set...
Marcos Kawazoe Aguilera, Carole Delporte-Gallet, H...
EWSN
2006
Springer
14 years 9 months ago
Generic Routing Metric and Policies for WSNs
Energy-aware algorithms have proven to be a crucial part of sensor network applications, especially if they are required to operate for extended periods of time. Among these, effic...
Olga Saukh, Pedro José Marrón, Andre...