Sciweavers

1200 search results - page 28 / 240
» Marked Ancestor Problems
Sort
View
FUIN
2010
130views more  FUIN 2010»
13 years 8 months ago
SLGAD Resolution for Inference on Logic Programs with Annotated Disjunctions
Abstract. Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in logic programming. The semantics of an LPAD is given in terms of the well...
Fabrizio Riguzzi
EOR
2006
118views more  EOR 2006»
13 years 10 months ago
A random-key genetic algorithm for the generalized traveling salesman problem
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
Lawrence V. Snyder, Mark S. Daskin
ICASSP
2009
IEEE
14 years 4 months ago
Using phase linearity in frequency-domain ICA to tackle the permutation problem
This paper describes a method for solving the permutation problem in the frequency-domain independent component analysis (FD-ICA) approach to blind source separation (BSS). FD-ICA...
Keisuke Toyama, Mark D. Plumbley
IJCAI
2001
13 years 11 months ago
Balance and Filtering in Structured Satisfiable Problems
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas...
GECCO
2007
Springer
132views Optimization» more  GECCO 2007»
14 years 4 months ago
The multi-objective next release problem
This paper is concerned with the Multi-Objective Next Release Problem (MONRP), a problem in search-based requirements engineering. Previous work has considered only single objecti...
Yuanyuan Zhang, Mark Harman, S. Afshin Mansouri