Sciweavers

7167 search results - page 580 / 1434
» Answer Set Programming
Sort
View
CP
2008
Springer
15 years 6 months ago
A Branch and Bound Algorithm for Numerical MAX-CSP
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 6 months ago
Parsimonious regularization using genetic algorithms applied to the analysis of analytical ultracentrifugation experiments
Frequently in the physical sciences experimental data are analyzed to determine model parameters using techniques known as parameter estimation. Eliminating the effects of noise ...
Emre H. Brookes, Borries Demeler
DEXA
2008
Springer
113views Database» more  DEXA 2008»
15 years 6 months ago
Optimal Preference Elicitation for Skyline Queries over Categorical Domains
When issuing user-specific queries, users often have a vaguely defined information need. Skyline queries identify the most "interesting" objects for users' incomplet...
Jongwuk Lee, Gae-won You, Seung-won Hwang, Joachim...
143
Voted
ESEM
2008
ACM
15 years 6 months ago
Reducing biases in individual software effort estimations: a combining approach
Software effort estimation techniques abound, each with its own set of advantages and disadvantages, and no one proves to be the single best answer. Combining estimating is an app...
Qi Li, Qing Wang, Ye Yang, Mingshu Li
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
15 years 6 months ago
Proximity Tracking on Time-Evolving Bipartite Graphs
Given an author-conference network that evolves over time, which are the conferences that a given author is most closely related with, and how do they change over time? Large time...
Hanghang Tong, Spiros Papadimitriou, Philip S. Yu,...