9997 search results - page 1637 / 2000 » The case for crowd computing |
208
click to vote
DISOPT
2008
15 years 6 months ago
2008
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
159
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
We study the problem of computing the k maximum sum subsequences. Given a sequence of real numbers x1, x2, . . . , xn and an integer parameter k, 1 k 1 2 n(n - 1), the problem in...
191
click to vote
EJC
2008
15 years 6 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
191
click to vote
ENTCS
2008
15 years 6 months ago
2008
bstraction Functor for Named Sets Vincenzo Ciancia 1 Ugo Montanari 1 Department of Computer Science University of Pisa lem of dening fully abstract operational models of name pass...
195
click to vote
FAC
2008
15 years 6 months ago
2008
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...