Sciweavers

245 search results - page 31 / 49
» Efficient Solving of Time-dependent Answer Set Programs
Sort
View
CP
2009
Springer
16 years 12 days ago
Coalition Structure Generation Utilizing Compact Characteristic Function Representations
This paper presents a new way of formalizing the Coalition Structure Generation problem (CSG), so that we can apply constraint optimization techniques to it. Forming effective coal...
Naoki Ohta, Vincent Conitzer, Ryo Ichimura, Yuko S...
66
Voted
CORR
2008
Springer
80views Education» more  CORR 2008»
14 years 12 months ago
Reserved-Length Prefix Coding
Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all cod...
Michael B. Baer
PVLDB
2008
136views more  PVLDB 2008»
14 years 11 months ago
Keyword query cleaning
Unlike traditional database queries, keyword queries do not adhere to predefined syntax and are often dirty with irrelevant words from natural languages. This makes accurate and e...
Ken Q. Pu, Xiaohui Yu
CACM
2008
101views more  CACM 2008»
14 years 12 months ago
Just say 'A Class Defines a Data Type'
data type and (Java) class, asking about the relationship between them. The same students would also be unlikely to find an answer in a CS1 textbook. Some textbooks might not even ...
Chenglie Hu
CEC
2011
IEEE
13 years 11 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