Sciweavers

44 search results - page 4 / 9
» Boolean Functions, Invariance Groups and Parallel Complexity
Sort
View
ISORC
2003
IEEE
14 years 1 months ago
Probabilistic Simulation-Based Analysis of Complex Real-Time Systems
Many industrial real-time systems have evolved over a long period of time and were initially so simple that it was possible to predict consequences of adding new functionality by ...
Anders Wall, Johan Andersson, Christer Norströ...
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
14 years 1 months ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy
WINE
2009
Springer
178views Economy» more  WINE 2009»
14 years 3 months ago
Computing Optimal Contracts in Series-Parallel Heterogeneous Combinatorial Agencies
We study an economic setting in which a principal motivates a team of strategic agents to exert costly effort toward the success of a joint project. The action taken by each agent...
Yuval Emek, Michal Feldman
CIE
2004
Springer
13 years 8 months ago
University of Southern California's Institute for Creative Technologies
When dealing with large, distributed systems that use state-of-the-art components, individual components are usually developed in parallel. As development continues, the decouplin...
Michael van Lent
SC
2005
ACM
14 years 2 months ago
Multilevel Parallelism in Computational Chemistry using Common Component Architecture and Global Arrays
The development of complex scientific applications for high-end systems is a challenging task. Addressing complexity of the involved software and algorithms is becoming increasing...
Manojkumar Krishnan, Yuri Alexeev, Theresa L. Wind...