3250 search results - page 103 / 650 » Parameterized Learning Complexity |
112
click to vote
SP
2002
IEEE
15 years 2 months ago
2002
IEEE
The design and prototype implementation of the XCAT Grid Science Portal is described in this paper. The portal lets grid application programmers easily script complex distributed ...
136
Voted
ISAAC
2010
Springer
15 years 8 days ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
107
click to vote
ALT
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Learning of recursive functions refutably means that for every recursive function, the learning machine has either to learn this function or to refute it, i.e., to signal...
107
click to vote
IJCAI
2003
15 years 3 months ago
2003
Multi-robot learning faces all of the challenges of robot learning with all of the challenges of multiagent learning. There has been a great deal of recent research on multiagent ...
113
click to vote
ICC
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract—We develop a family of distributed wireless scheduling algorithms that requires only O(1) complexity for M-hop interference model, for any finite M. The recent technolo...