Sciweavers

4781 search results - page 232 / 957
» Complexity at large
Sort
View
133
Voted
CI
2005
106views more  CI 2005»
15 years 20 days ago
Incremental Learning of Procedural Planning Knowledge in Challenging Environments
Autonomous agents that learn about their environment can be divided into two broad classes. One class of existing learners, reinforcement learners, typically employ weak learning ...
Douglas J. Pearson, John E. Laird
117
Voted
VLSID
2002
IEEE
152views VLSI» more  VLSID 2002»
16 years 1 months ago
Verification of an Industrial CC-NUMA Server
Directed test program-based verification or formal verification methods are usually quite ineffective on large cachecoherent, non-uniform memory access (CC-NUMA) multiprocessors b...
Rajarshi Mukherjee, Yozo Nakayama, Toshiya Mima
AUIC
2006
IEEE
15 years 6 months ago
Visualisations of execution traces (VET): an interactive plugin-based visualisation tool
An execution trace contains a description of everything that happened during an execution of a program. Execution traces are useful, because they can help software engineers under...
Mike McGavin, Tim Wright, Stuart Marshall
128
Voted
INFOCOM
2012
IEEE
13 years 3 months ago
Locating malicious nodes for data aggregation in wireless networks
—Data aggregation, as a primitive communication task in wireless networks, can reduce the communication complexity. However, in-network aggregation usually brings an unavoidable ...
XiaoHua Xu, Qian Wang, Jiannong Cao, Peng-Jun Wan,...
89
Voted
ICPR
2004
IEEE
16 years 1 months ago
On Classifier Domains of Competence
We study the domain of dominant competence of six popular classifiers in a space of data complexity measurements. We observe that the simplest classifiers, nearest neighbor and li...
Ester Bernadó i Mansilla, Tin Kam Ho