Sciweavers

6300 search results - page 1061 / 1260
» We have it easy, but do we have it right
Sort
View
DAC
1994
ACM
15 years 5 months ago
Optimum Functional Decomposition Using Encoding
In this paper, we revisit the classical problem of functional decomposition [1, 2] that arises so often in logic synthesis. One basic problem that has remained largely unaddressed...
Rajeev Murgai, Robert K. Brayton, Alberto L. Sangi...
CP
2008
Springer
15 years 3 months ago
Elicitation Strategies for Fuzzy Constraint Problems with Missing Preferences: Algorithms and Experimental Studies
Fuzzy constraints are a popular approach to handle preferences and over-constrained problems in scenarios where one needs to be cautious, such as in medical or space applications. ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
118
Voted
SIROCCO
2008
15 years 2 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...
NSDI
2004
15 years 2 months ago
Measurement and Analysis of Spyware in a University Environment
Over the past few years, a relatively new computing phenomenon has gained momentum: the spread of "spyware." Though most people are aware of spyware, the research commun...
Stefan Saroiu, Steven D. Gribble, Henry M. Levy
ATAL
2010
Springer
15 years 2 months ago
Scalable mechanism design for the procurement of services with uncertain durations
In this paper, we study a service procurement problem with uncertainty as to whether service providers are capable of completing a given task within a specified deadline. This typ...
Enrico Gerding, Sebastian Stein, Kate Larson, Alex...
« Prev « First page 1061 / 1260 Last » Next »