Sciweavers

106 search results - page 13 / 22
» A formal study of information retrieval heuristics
Sort
View
SAS
2007
Springer
14 years 2 months ago
Program Analysis Using Symbolic Ranges
Interval analysis seeks static lower and upper bounds on the values of program variables. These bounds are useful, especially for inferring invariants to prove buffer overflow ch...
Sriram Sankaranarayanan, Franjo Ivancic, Aarti Gup...
IEEEICCI
2006
IEEE
14 years 2 months ago
SenseNet: A Knowledge Representation Model for Computational Semantics
Knowledge representation is essential for semantics modeling and intelligent information processing. For decades researchers have proposed many knowledge representation techniques...
Ping Chen, Wei Ding 0003, Chengmin Ding
GECCO
2011
Springer
261views Optimization» more  GECCO 2011»
12 years 12 months ago
Spacing memetic algorithms
We introduce the Spacing Memetic Algorithm (SMA), a formal evolutionary model devoted to a systematic control of spacing (distances) among individuals. SMA uses search space dista...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
IJIS
2008
83views more  IJIS 2008»
13 years 8 months ago
An algorithm for modelling key terms
The ability to analyse and represent formally semantic relations of terms is a core issue in information retrieval (IR), natural language processing (NLP), and in many related are...
D. Cai, C. J. van Rijsbergen
PODS
2006
ACM
177views Database» more  PODS 2006»
14 years 8 months ago
Equivalence of queries combining set and bag-set semantics
The query equivalence problem has been studied extensively for set-semantics and, more recently, for bag-set semantics. However, SQL queries often combine set and bag-set semantic...
Sara Cohen