Sciweavers

1816 search results - page 23 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
COR
2006
98views more  COR 2006»
14 years 12 months ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve
IWPEC
2004
Springer
15 years 5 months ago
A Structural View on Parameterizing Problems: Distance from Triviality
Based on a series of known and new examples, we propose the generalized setting of “distance from triviality” measurement as a reasonable and prospective way of determining use...
Jiong Guo, Falk Hüffner, Rolf Niedermeier
IJCAI
2007
15 years 1 months ago
A Hybrid Ontology Directed Feedback Selection Algorithm for Supporting Creative Problem Solving Dialogues
We evaluate a new hybrid language processing approach designed for interactive applications that maintain an interaction with users over multiple turns. Specifically, we describe ...
Hao-Chuan Wang, Rohit Kumar, Carolyn Penstein Ros&...
IAT
2006
IEEE
15 years 5 months ago
Toward Inductive Logic Programming for Collaborative Problem Solving
In this paper, we tackle learning in distributed systems and the fact that learning does not necessarily involve the participation of agents directly in the inductive process itse...
Jian Huang, Adrian R. Pearce
GECCO
2004
Springer
122views Optimization» more  GECCO 2004»
15 years 5 months ago
An Improved Diversity Mechanism for Solving Constrained Optimization Problems Using a Multimembered Evolution Strategy
This paper presents an improved version of a simple evolution strategy (SES) to solve global nonlinear optimization problems. As its previous version, the approach does not require...
Efrén Mezura-Montes, Carlos A. Coello Coell...