Sciweavers

4401 search results - page 418 / 881
» Computing with Default Logic
Sort
View
CONCUR
1993
Springer
15 years 11 months ago
A Practical Technique for Process Abstraction
cal Technique for Process Abstraction Glenn Bruns Department of Computer Science University of Edinburgh Edinburgh EH9 3JZ, UK Abstract. With algebraic laws a process can be simpli...
Glenn Bruns
RSCTC
2000
Springer
151views Fuzzy Logic» more  RSCTC 2000»
15 years 10 months ago
Anytime Algorithm for Feature Selection
Feature selection is used to improve performance of learning algorithms by finding a minimal subset of relevant features. Since the process of feature selection is computationally ...
Mark Last, Abraham Kandel, Oded Maimon, Eugene Ebe...
CORR
2007
Springer
64views Education» more  CORR 2007»
15 years 6 months ago
Generating models for temporal representations
We discuss the use of model building for temporal representations. We chose Polish to illustrate our discussion because it has an interesting aspectual system, but the points we w...
Patrick Blackburn, Sébastien Hinderer
CIRA
2007
IEEE
136views Robotics» more  CIRA 2007»
16 years 1 months ago
Algebraic interval constraint driven exploration in human-agent collaborative problem solving
—To enable effective human-agent collaboration, new human-centric computing paradigms are needed. This paper presents a soft constraint representation scheme based on generalized...
Yan Wang
ICALP
2003
Springer
16 years 10 hour ago
Oracle Circuits for Branching-Time Model Checking
A special class of oracle circuits with tree-vector form is introduced. It is shown that they can be evaluated in deterministic polynomial-time with a polylog number of adaptive qu...
Ph. Schnoebelen