Sciweavers

12741 search results - page 2244 / 2549
» Editorial and call for papers
Sort
View
ESA
2007
Springer
143views Algorithms» more  ESA 2007»
16 years 26 days ago
Two's Company, Three's a Crowd: Stable Family and Threesome Roommates Problems
We investigate Knuth’s eleventh open question on stable matchings. In the stable family problem, sets of women, men, and dogs are given, all of whom state their preferences among...
Chien-Chung Huang
ESOP
2007
Springer
16 years 26 days ago
On the Implementation of Construction Functions for Non-free Concrete Data Types
Abstract. Many algorithms use concrete data types with some additional invariants. The set of values satisfying the invariants is often a set of representatives for the equivalence...
Frédéric Blanqui, Thérè...
EUC
2007
Springer
16 years 26 days ago
A Selective Push Algorithm for Cooperative Cache Consistency Maintenance over MANETs
Cooperative caching is an important technique to support efficient data dissemination and sharing in Mobile Ad hoc Networks (MANETs). In order to ensure valid data access, the cach...
Yu Huang 0002, Beihong Jin, Jiannong Cao, Guangzho...
FC
2007
Springer
125views Cryptology» more  FC 2007»
16 years 26 days ago
Scalable Authenticated Tree Based Group Key Exchange for Ad-Hoc Groups
Task-specific groups are often formed in an ad-hoc manner within big structures, like companies. Take the following typical scenario: A high rank manager decides that a task force...
Yvo Desmedt, Tanja Lange, Mike Burmester
FPGA
2007
ACM
163views FPGA» more  FPGA 2007»
16 years 26 days ago
Improved SAT-based Boolean matching using implicants for LUT-based FPGAs
Boolean matching (BM) is a widely used technique in FPGA resynthesis and architecture evaluation. In this paper we present several improvements to the recently proposed SAT-based ...
Jason Cong, Kirill Minkovich
« Prev « First page 2244 / 2549 Last » Next »