Sciweavers

1174 search results - page 209 / 235
» Optimizing generics is easy!
Sort
View
ACNS
2009
Springer
142views Cryptology» more  ACNS 2009»
14 years 5 months ago
Group Key Exchange Enabling On-Demand Derivation of Peer-to-Peer Keys
We enrich the classical notion of group key exchange (GKE) protocols by a new property that allows each pair of users to derive an independent peer-to-peer (p2p) key on-demand and ...
Mark Manulis
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
14 years 5 months ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
14 years 4 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
GECCO
2004
Springer
179views Optimization» more  GECCO 2004»
14 years 4 months ago
An Evolutionary Meta Hierarchical Scheduler for the Linux Operating System
Abstract. The need for supporting CSCW applications with heterogeneous and varying user requirements calls for adaptive and reconfigurable schedulers accommodating a mixture of re...
Horst Wedde, Muddassar Farooq, Mario Lischka
EDBT
2010
ACM
189views Database» more  EDBT 2010»
14 years 4 months ago
Efficient physical operators for cost-based XPath execution
The creation of a generic and modular query optimization and processing infrastructure can provide significant benefits to XML data management. Key pieces of such an infrastructur...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...