874 search results - page 165 / 175 » Computing Weighted Solutions in Answer Set Programming |
IJWMC
2010
14 years 9 months ago
2010
The past few years have seen a burst in public interest and widespread use of portable electronic devices featuring both mature and emerging technologies for wireless communication...
115
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches t...
CONSTRAINTS
2007
14 years 11 months ago
2007
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
100
Voted
CPM
2000
Springer
15 years 4 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...