1686 search results - page 150 / 338 » Programs as polygraphs: computability and complexity |
203
Voted
ICDCS
2012
IEEE
13 years 6 months ago
2012
IEEE
—Cloud resources are usually priced in multiple markets with different service guarantees. For example, Amazon EC2 prices virtual instances under three pricing schemes — the su...
124
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...
111
Voted
IJAC
2006
15 years 3 months ago
2006
By the fundamental theorem of symmetric polynomials, if P Q[X1, . . . , Xn] is symmetric, then it can be written P = Q(1, . . . , n), where 1, . . . , n are the elementary symmet...
124
click to vote
ALIFE
1998
15 years 3 months ago
1998
Creating artificial life forms through evolutionary robotics faces a “chicken and egg” problem: learning to control a complex body is dominated by problems specific to its s...
138
Voted
SIGSOFT
2010
ACM
15 years 1 months ago
2010
ACM
Software systems must face two challenges today: growing complexity and increasing parallelism in the underlying computational models. The problem of increased complexity is often...