Sciweavers

1727 search results - page 135 / 346
» A Technique for Large Automated Mechanism Design Problems
Sort
View
AMAI
2000
Springer
15 years 10 months ago
On Solving Boolean Optimization with Satisfiability-Based Algorithms
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
Vasco M. Manquinho, João P. Marques Silva
CF
2008
ACM
15 years 8 months ago
A distributed evolutionary method to design scheduling policies for volunteer computing
Volunteer Computing (VC) is a paradigm that takes advantage of idle cycles from computing resources donated by volunteers and connected through the Internet to compute large-scale...
Trilce Estrada, Olac Fuentes, Michela Taufer
TPDS
2002
104views more  TPDS 2002»
15 years 6 months ago
Composite Synchronization in Parallel Discrete-Event Simulation
This paper considers a technique for composing global (barrier-style) and local (channel scanning) synchronization protocols within a single parallel discrete-event simulation. Com...
David M. Nicol, Jason Liu
WWW
2010
ACM
16 years 1 months ago
Malicious interface design: exploiting the user
In an ideal world, interface design is the art and science of helping users accomplish tasks in a timely, efficient, and pleasurable manner. This paper studies the inverse situati...
Gregory J. Conti, Edward Sobiesk
COR
2008
128views more  COR 2008»
15 years 6 months ago
Search-based software engineering
In the past five years there has been a dramatic increase in work on Search Based Software Engineering (SBSE), an approach to software engineering in which search based optimisatio...
Walter J. Gutjahr, Mark Harman