Sciweavers

8728 search results - page 191 / 1746
» On Reduct Construction Algorithms
Sort
View
AI
2008
Springer
15 years 6 months ago
Maintenance goals of agents in a dynamic environment: Formulation and policy construction
The notion of maintenance often appears in the AI literature in the context of agent behavior and planning. In this paper, we argue that earlier characterizations of the notion of...
Chitta Baral, Thomas Eiter, Marcus Bjäreland,...
ATAL
2007
Springer
16 years 21 days ago
Multiagent based construction for human-like architecture
Collaborative construction is a main application in the field of autonomous systems. An interesting subject in the area is the construction of realistic human-like architecture. ...
Yifeng Zeng, Dennis Plougman Buus, Jorge Cordero H...
TCS
2008
15 years 6 months ago
On-line construction of compact suffix vectors and maximal repeats
A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [9, 10, 11]. They proposed a linear constru...
Élise Prieur, Thierry Lecroq
COCO
2009
Springer
105views Algorithms» more  COCO 2009»
16 years 1 months ago
Planar Graph Isomorphism is in Log-Space
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Th...
SODA
2012
ACM
253views Algorithms» more  SODA 2012»
13 years 9 months ago
Kernelization of packing problems
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
Holger Dell, Dániel Marx