461 search results - page 80 / 93 » Component-Based Answer Set Programming |
COCO
1995
Springer
15 years 5 months ago
1995
Springer
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
117
click to vote
SEMWEB
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Nowadays enterprises request information technologies that leverage structured and unstructured information for providing a single integrated view of business problems in...
120
click to vote
AAAI
1996
15 years 2 months ago
1996
The Airport Example The Omelette Example Copyright c 1996 American Association for Artificial Intelligence. All rights reserved. Despite the existence of programs that are able to ...
127
click to vote
CACM
2008
15 years 1 months ago
2008
data type and (Java) class, asking about the relationship between them. The same students would also be unlikely to find an answer in a CS1 textbook. Some textbooks might not even ...
143
click to vote
CEC
2011
IEEE
14 years 1 months ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...