6455 search results - page 318 / 1291 » Research problems |
150
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
— Extracting useful correlation from a dataset has been extensively studied. In this paper, we deal with the opposite, namely, a problem we call correlation hiding (CH), which is...
156
click to vote
CPAIOR
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. In this paper, we introduce a Yet ImprovEd Limited Discrepancy Search (YIELDS), a complete algorithm for solving Constraint Satisfaction Problems. As indicated in its nam...
174
click to vote
CPAIOR
2007
Springer
16 years 25 days ago
2007
Springer
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
138
click to vote
ICSEA
2006
IEEE
16 years 21 days ago
2006
IEEE
ey operate with computer abstractions not with AD ions they cannot fully bridge the semantic gap between IT and AD. Therefore, we can safely conclude that the research on computer ...
135
click to vote
CPAIOR
2004
Springer
16 years 2 days ago
2004
Springer
We discuss a di cult optimization problem on a chess-board, requiring equal numbers of black and white queens to be placed on the board so that the white queens cannot attack the b...