6894 search results - page 910 / 1379 » Generation Problems |
155
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this paper, we investigate how an IA network can be effectively encoded into the SAT domain. We propose two basic approaches to modelling an IA network as a CSP: one r...
201
click to vote
ICWS
2004
IEEE
15 years 8 months ago
2004
IEEE
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
176
click to vote
ICS
2001
Tsinghua U.
15 years 11 months ago
2001
Tsinghua U.
At Rice University, we have undertaken a project to construct a framework for generating high-level problem solving languages that can achieve high performance on a variety of pla...
192
click to vote
AI
2008
Springer
15 years 7 months ago
2008
Springer
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
193
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
Given a user in a social network, which new friends should we recommend, the dual goal being to achieve user satisfaction and good network connectivity? Similarly, which new produc...