Sciweavers

7988 search results - page 1264 / 1598
» A Useful Undecidable Theory
Sort
View
GECCO
2006
Springer
181views Optimization» more  GECCO 2006»
15 years 10 months ago
Robustness in cooperative coevolution
Though recent analysis of traditional cooperative coevolutionary algorithms (CCEAs) casts doubt on their suitability for static optimization tasks, our experience is that the algo...
R. Paul Wiegand, Mitchell A. Potter
RSCTC
2000
Springer
227views Fuzzy Logic» more  RSCTC 2000»
15 years 10 months ago
Rough Sets in Approximate Spatial Reasoning
Abstract. In spatial reasoning the qualitative description of relations between spatial regions is of practical importance and has been widely studied. Examples of such relations a...
Thomas Bittner, John G. Stell
CHI
1995
ACM
15 years 10 months ago
Integrating multiple cues for spoken language understanding
As spoken language interfaces for real-world systems become a practical possibility, it has become apparent that such interfaces will need to draw on a variety of cues from divers...
Karen Ward, David G. Novick
COMPGEOM
1995
ACM
15 years 10 months ago
How Good are Convex Hull Algorithms?
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
David Avis, David Bremner
TPHOL
2000
IEEE
15 years 10 months ago
Equational Reasoning via Partial Reflection
We modify the reflection method to enable it to deal with partial functions like division. The idea behind reflection is to program a tactic for a theorem prover not in the impleme...
Herman Geuvers, Freek Wiedijk, Jan Zwanenburg
« Prev « First page 1264 / 1598 Last » Next »