Sciweavers

8437 search results - page 1350 / 1688
» Preferences over Sets
Sort
View
JAR
2011
112views more  JAR 2011»
15 years 1 months ago
A Framework for Certified Boolean Branch-and-Bound Optimization
We consider optimization problems of the form (S, cost), where S is a clause set over Boolean variables x1 . . . xn, with an arbitrary cost function cost: Bn → R, and the aim is ...
Javier Larrosa, Robert Nieuwenhuis, Albert Olivera...
SOFTWARE
2011
15 years 1 months ago
A Synergetic Approach to Throughput Computing on x86-Based Multicore Desktops
In the era of multicores, many applications that tend to require substantial compute power and data crunching (aka Throughput Computing Applications) can now be run on desktop PCs...
Chi-Keung Luk, Ryan Newton, William Hasenplaugh, M...
EOR
2010
159views more  EOR 2010»
15 years 1 months ago
An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
The vehicle routing problem with multiple use of vehicles is a variant of the classical vehicle routing problem. It arises when each vehicle performs several routes during the wor...
Nabila Azi, Michel Gendreau, Jean-Yves Potvin
IHI
2010
169views Healthcare» more  IHI 2010»
15 years 1 months ago
Dynamic scheduling of emergency department resources
The processes carried out in a hospital emergency department can be thought of as structures of activities that require resources in order to execute. Costs are reduced when resou...
Junchao Xiao, Leon J. Osterweil, Qing Wang
IJNSEC
2010
143views more  IJNSEC 2010»
15 years 1 months ago
Nonce Generation For The Digital Signature Standard
Digital Signature Algorithm (DSA) is an underlying algorithm to form a signature in the Digital Signature Standard (DSS). DSA uses a new random number (or nonce) each time a signa...
Rajendra S. Katti, Rajesh G. Kavasseri
« Prev « First page 1350 / 1688 Last » Next »