Sciweavers

36781 search results - page 25 / 7357
» Parameterizing by the Number of Numbers
Sort
View
TCS
2010
13 years 6 months ago
Iterative compression and exact algorithms
Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponen...
Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mat...
IFIP
2001
Springer
14 years 4 days ago
An Evolutionary Approach for Pareto-optimal Configurations in SOC Platforms
: One of the most important problems in SOC platforms design is that of defining strategies for tuning the parameters of a parameterized system so as to obtain the Pareto-optimal s...
Giuseppe Ascia, Vincenzo Catania, Maurizio Palesi
PC
1998
132views Management» more  PC 1998»
13 years 7 months ago
Parallel Linear Congruential Generators with Prime Moduli
Linear congruential generators (LCGs) remain the most popular method of pseudorandom number generation on digital computers. Ease of implementation has favored implementing LCGs wi...
Michael Mascagni
MICS
2010
77views more  MICS 2010»
13 years 6 months ago
Preemptive Scheduling of Equal-Length Jobs in Polynomial Time
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighte...
George B. Mertzios, Walter Unger
ECBS
2000
IEEE
70views Hardware» more  ECBS 2000»
14 years 3 days ago
Model Checking the Java Meta-Locking Algorithm
We apply the XMC model checker to the Java metalocking algorithm, a highly optimized technique for ensuring mutually exclusive access by threads to object monitor queues. Our abst...
Samik Basu, Scott A. Smolka, Orson R. Ward