Sciweavers

1623 search results - page 155 / 325
» No Sorting
Sort
View
COCO
1997
Springer
144views Algorithms» more  COCO 1997»
15 years 9 months ago
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
Kenneth W. Regan
156
Voted
ILP
1997
Springer
15 years 9 months ago
A Logical Framework for Graph Theoretical Decision Tree Learning
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
Peter Geibel, Fritz Wysotzki
139
Voted
RT
1997
Springer
15 years 9 months ago
Incremental Updates to Scenes Illuminated by Area Light Sources
Abstract: An object space algorithm for computing shadows in dynamic scenes illuminated by area light sources is presented. A mesh with the shadow boundaries as well as other disco...
Yiorgos Chrysanthou, Mel Slater
129
Voted
CHI
1993
ACM
15 years 9 months ago
Summarising the evolution of design concepts within a design rationale framework
A design rationale (DR) is a representation of the reasoning which has been invested in a design [1]. This short paper describes the use of the QOC Design Space Analysis approach ...
Simon Buckingham Shum, Allan MacLean, Justin Forde...
128
Voted
ICLP
1994
Springer
15 years 9 months ago
Language Independence and Language Tolerance in Logic Programs
The consequences of a logic program depend in general upon both the rules of the program and its language. However the consequences of some programs are independent of the choice ...
Norman McCain, Hudson Turner