Sciweavers

2173 search results - page 287 / 435
» On the Values of Reducibility Candidates
Sort
View
SIGECOM
2010
ACM
201views ECommerce» more  SIGECOM 2010»
15 years 11 months ago
Truthful assignment without money
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
Shaddin Dughmi, Arpita Ghosh
GPCE
2009
Springer
15 years 11 months ago
Algorithms for user interfaces
User interfaces for modern applications must support a rich set of interactive features. It is commonplace to find applications with dependencies between values manipulated by us...
Jaakko Järvi, Mat Marcus, Sean Parent, John F...
DATE
2010
IEEE
175views Hardware» more  DATE 2010»
15 years 10 months ago
Approximate logic synthesis for error tolerant applications
─ Error tolerance formally captures the notion that – for a wide variety of applications including audio, video, graphics, and wireless communications – a defective chip that...
Doochul Shin, Sandeep K. Gupta
CMSB
2008
Springer
15 years 8 months ago
Automatic Complexity Analysis and Model Reduction of Nonlinear Biochemical Systems
Kinetic models for biochemical systems often comprise a large amount of coupled differential equations with species concentrations varying on different time scales. In this paper w...
Dirk Lebiedz, Dominik Skanda, Marc Fein
MICRO
2008
IEEE
137views Hardware» more  MICRO 2008»
15 years 6 months ago
Verification of chip multiprocessor memory systems using a relaxed scoreboard
Verification of chip multiprocessor memory systems remains challenging. While formal methods have been used to validate protocols, simulation is still the dominant method used to ...
Ofer Shacham, Megan Wachs, Alex Solomatnikov, Amin...