612 search results - page 73 / 123 » Hardness assumptions in the foundations of theoretical compu... |
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
ERSHOV
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Text Categorization algorithms have a large number of parameters that determine their behaviour, whose effect is not easily predicted objectively or intuitively and may v...
ACSC
2010
IEEE
13 years 2 months ago
2010
IEEE
This paper discusses the design and implementation of a payment framework that is loosely based on the direct debit payment model. We define such payments as one in which customer...
POPL
2003
ACM
14 years 8 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
TACAS
2010
Springer
14 years 2 months ago
2010
Springer
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...