1225 search results - page 155 / 245 » The Instance Complexity Conjecture |
150
Voted
LOPSTR
2005
Springer
15 years 8 months ago
2005
Springer
We propose an extension of functional logic languages that allows the definition of operations with patterns containing other defined operation symbols. Such “function patterns...
140
Voted
GPCE
2004
Springer
15 years 8 months ago
2004
Springer
Scheme includes a simple yet powerful macro mechanism. Using macros, programmers can easily extend the language with new kinds of expressions and definitions, thus abstracting ove...
121
Voted
CIAC
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
115
click to vote
CP
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
107
Voted
SIGGRAPH
1998
ACM
15 years 7 months ago
1998
ACM
Modeling and rendering of natural scenes with thousands of plants poses a number of problems. The terrain must be modeled and plants must be distributed throughout it in a realist...