Sciweavers

16404 search results - page 483 / 3281
» A set coverage problem
Sort
View
ANOR
2011
169views more  ANOR 2011»
14 years 10 months ago
Predetermined intervals for start times of activities in the stochastic project scheduling problem
This paper proposes a new methodology to schedule activities in projects with stochastic activity durations. The main idea is to determine for each activity an interval in which th...
Illana Bendavid, Boaz Golany
ICCV
2011
IEEE
14 years 6 months ago
Optimizing Polynomial Solvers for Minimal Geometry Problems
In recent years polynomial solvers based on algebraic geometry techniques, and specifically the action matrix method, have become popular for solving minimal problems in computer...
Oleg Naroditsky, Kostas Daniilidis
CADE
2003
Springer
16 years 7 months ago
Certifying Solutions to Permutation Group Problems
We describe the integration of permutation group algorithms with proof planning. We consider eight basic questions arising in computational permutation group theory, for which our ...
Arjeh M. Cohen, Scott H. Murray, Martin Pollet, Vo...
OSDI
2008
ACM
16 years 7 months ago
Hunting for Problems with Artemis
Artemis is a modular application designed for analyzing and troubleshooting the performance of large clusters running datacenter services. Artemis is composed of four modules: (1)...
Gabriela F. Cretu-Ciocarlie, Mihai Budiu, Mois&eac...
173
Voted
LICS
2009
IEEE
16 years 1 months ago
The Inverse Taylor Expansion Problem in Linear Logic
Linear Logic is based on the analogy between algebraic linearity (i.e. commutation with sums and scalar products) and the computer science linearity (i.e. calling inputs only once...
Michele Pagani, Christine Tasson