Sciweavers

7106 search results - page 1093 / 1422
» Restricted Complexity, General Complexity
Sort
View
MC
2001
116views Computer Science» more  MC 2001»
15 years 8 months ago
Emotions and Multimodal Interface-Agents: A Sociological View
Designing human-computer interfaces that are easy and intuitive to use is important for the use of computer technology in general. Due to the growing complexity of information sys...
Daniel Moldt, Christian von Scheve
P2PKM
2004
15 years 8 months ago
KEEx: A Peer-to-Peer Solution for Distributed Knowledge Management
: Distributed Knowledge Management is an approach to Knowledge Management based on the principle that the multiplicity (and heterogeneity) of perspectives within complex organizati...
Matteo Bonifacio, Paolo Bouquet, Paolo Busetta, Al...
ICAI
2003
15 years 8 months ago
Threshold Behavior in a Boolean Network Model for SAT
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
Alejandro Bugacov, Aram Galstyan, Kristina Lerman
ICMLA
2003
15 years 8 months ago
A Distributed Reinforcement Learning Approach to Pattern Inference in Go
— This paper shows that the distributed representation found in Learning Vector Quantization (LVQ) enables reinforcement learning methods to cope with a large decision search spa...
Myriam Abramson, Harry Wechsler
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
15 years 8 months ago
Bipartite roots of graphs
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
Lap Chi Lau
« Prev « First page 1093 / 1422 Last » Next »