Sciweavers

1984 search results - page 378 / 397
» Variable mesh optimization for continuous optimization probl...
Sort
View
ICCS
2009
Springer
14 years 3 months ago
Distinguishing Answers in Conceptual Graph Knowledge Bases
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
Nicolas Moreau, Michel Leclère, Madalina Cr...
CEC
2011
IEEE
12 years 8 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
ICDT
2009
ACM
147views Database» more  ICDT 2009»
14 years 9 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
INFOCOM
2012
IEEE
11 years 11 months ago
DEAR: Delay-bounded Energy-constrained Adaptive Routing in wireless sensor networks
— Reliability and energy efficiency are critical issues in wireless sensor networks. In this work, we study Delay-bounded Energy-constrained Adaptive Routing (DEAR) problem with...
Shi Bai, Weiyi Zhang, Guoliang Xue, Jian Tang, Cho...
CORR
2010
Springer
171views Education» more  CORR 2010»
13 years 3 months ago
Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
Cem Tekin, Mingyan Liu