Sciweavers

1772 search results - page 73 / 355
» Classifying Problems into Complexity Classes
Sort
View
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 19 days ago
Quantifying Homology Classes
We develop a method for measuring homology classes. This involves three problems. First, we define the size of a homology class, using ideas from relative homology. Second, we defi...
Chao Chen, Daniel Freedman
ATAL
2001
Springer
15 years 5 months ago
A Stable and Feasible Payoff Division for Coalition Formation in a Class of Task Oriented Domains
In the last few years the use of coalition formation algorithms in multi-agent systems has been proposed as a possible way of modelling autonomous agent cooperation. Game theory pr...
María-Victoria Belmonte, Ricardo Conejo, Jo...
107
Voted
EUROCOLT
1995
Springer
15 years 4 months ago
The structure of intrinsic complexity of learning
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
Sanjay Jain, Arun Sharma
110
Voted
CVPR
2007
IEEE
16 years 2 months ago
Fast Terrain Classification Using Variable-Length Representation for Autonomous Navigation
We propose a method for learning using a set of feature representations which retrieve different amounts of information at different costs. The goal is to create a more efficient ...
Anelia Angelova, Larry Matthies, Daniel M. Helmick...
96
Voted
ICSE
2004
IEEE-ACM
16 years 19 days ago
Problem Structure and Dependable Architecture
An approach to software development is sketched in which problem structuring is separated from software architecture. The problem is decomposed into subproblems of familiar classes...
Michael Jackson