Sciweavers

16596 search results - page 238 / 3320
» Generalized Assignment Problems
Sort
View
POPL
2007
ACM
16 years 7 months ago
Lock allocation
We introduce lock allocation, an automatic technique that takes a multi-threaded program annotated with atomic sections (that must be executed atomically), and infers a lock assig...
Michael Emmi, Jeffrey S. Fischer, Ranjit Jhala, Ru...
ISPD
2010
ACM
249views Hardware» more  ISPD 2010»
16 years 1 months ago
A matching based decomposer for double patterning lithography
Double Patterning Lithography (DPL) is one of the few hopeful candidate solutions for the lithography for CMOS process beyond 45nm. DPL assigns the patterns less than a certain di...
Yue Xu, Chris Chu
183
Voted
IPPS
2009
IEEE
16 years 1 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...
IJCNN
2007
IEEE
16 years 28 days ago
Preference Learning for Category-Ranking based Interactive Text Categorization
— Category Ranking is a variant of the multi-label classification problem, in which, rather than performing a (hard) assignment to an object of categories from a predefined set...
Fabio Aiolli, Fabrizio Sebastiani, Alessandro Sper...
CP
2007
Springer
16 years 24 days ago
An Integrated White+Black Box Approach for Designing and Tuning Stochastic Local Search
Abstract. Stochastic Local Search (SLS) is a simple and effective paradigm for attacking a variety of Combinatorial (Optimization) Problems (COP). However, it is often non-trivial...
Steven Halim, Roland H. C. Yap, Hoong Chuin Lau