Sciweavers

5289 search results - page 330 / 1058
» Evolutionary Computation for Modeling and Optimization
Sort
View
ICCAD
2003
IEEE
148views Hardware» more  ICCAD 2003»
16 years 3 months ago
The Compositional Far Side of Image Computation
Symbolic image computation is the most fundamental computation in BDD-based sequential system optimization and formal verification. In this paper, we explore the use of over-appr...
Chao Wang, Gary D. Hachtel, Fabio Somenzi
TMC
2011
219views more  TMC 2011»
15 years 1 months ago
Optimal Channel Access Management with QoS Support for Cognitive Vehicular Networks
We consider the problem of optimal channel access to provide quality of service (QoS) for data transmission in cognitive vehicular networks. In such a network the vehicular nodes ...
Dusit Niyato, Ekram Hossain, Ping Wang
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
16 years 24 days ago
On Secure Multi-party Computation in Black-Box Groups
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...
SOSP
2009
ACM
16 years 3 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...
TCS
2002
15 years 6 months ago
Asymptotic behavior in a heap model with two pieces
In a heap model, solid blocks, or pieces, pile up according to the Tetris game mechanism. An optimal schedule is an in nite sequence of pieces minimizing the asymptotic growth rat...
Jean Mairesse, Laurent Vuillon