200 search results - page 28 / 40 » Sketching valuation functions |
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
185
Voted
PERVASIVE
2011
Springer
14 years 10 days ago
2011
Springer
Abstract. In this paper, we introduce CityCompiler, an integrated environment for the iteration-based development of spatial interactive systems. CityCompiler visualizes interactiv...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
In the classical binary genetic algorithm, although crossover within a building block (BB) does not always cause a decrease in fitness, any decrease in fitness results from the ...
GRAPHICSINTERFACE
2000
14 years 11 months ago
2000
Character animation is usually reserved for highly skilled animators and computer programmers because few of the available tools allow the novice or casual user to create compelli...
ICFP
2007
ACM
15 years 9 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...