Sciweavers

211 search results - page 32 / 43
» On the Proof Theory of the Existence Predicate
Sort
View
AI
2008
Springer
13 years 8 months ago
Modelling and solving temporal reasoning as propositional satisfiability
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
Duc Nghia Pham, John Thornton, Abdul Sattar
KDD
2008
ACM
120views Data Mining» more  KDD 2008»
14 years 9 months ago
Multi-class cost-sensitive boosting with p-norm loss functions
We propose a family of novel cost-sensitive boosting methods for multi-class classification by applying the theory of gradient boosting to p-norm based cost functionals. We establ...
Aurelie C. Lozano, Naoki Abe
MOBIHOC
2008
ACM
14 years 8 months ago
Self-monitoring for sensor networks
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
Dezun Dong, Yunhao Liu, Xiangke Liao
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
14 years 2 months ago
Using group selection to evolve leadership in populations of self-replicating digital organisms
This paper describes a study in the evolution of distributed cooperative behavior, specifically leader election, through digital evolution and group selection. In digital evoluti...
David B. Knoester, Philip K. McKinley, Charles Ofr...
DAM
2008
84views more  DAM 2008»
13 years 8 months ago
Edge-splittings preserving local edge-connectivity of graphs
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
Zoltán Szigeti