Sciweavers

356 search results - page 30 / 72
» Parallelizing time with polynomial circuits
Sort
View
ECCC
2000
101views more  ECCC 2000»
13 years 9 months ago
Simplified derandomization of BPP using a hitting set generator
Abstract. A hitting-set generator is a deterministic algorithm that generates a set of strings such that this set intersects every dense set that is recognizable by a small circuit...
Oded Goldreich, Salil P. Vadhan, Avi Wigderson
ICCD
2001
IEEE
121views Hardware» more  ICCD 2001»
14 years 6 months ago
Determining Schedules for Reducing Power Consumption Using Multiple Supply Voltages
Dynamic power is the main source of power consumption in CMOS circuits. It depends on the square of the supply voltage. It may significantly be reduced by scaling down the supply ...
Noureddine Chabini, El Mostapha Aboulhamid, Yvon S...
ACTA
2006
154views more  ACTA 2006»
13 years 9 months ago
Solving HPP and SAT by P Systems with Active Membranes and Separation Rules
The P systems (or membrane systems) are a class of distributed parallel computing devices of a biochemical type, where membrane division is the frequently investigated way for obta...
Linqiang Pan, Artiom Alhazov
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
PPAM
2005
Springer
14 years 2 months ago
Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints
We address a generalization of the classical 1- and 2-processor UET scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous av...
Krzysztof Giaro, Marek Kubale