7167 search results - page 147 / 1434 » Answer Set Programming |
96
Voted
STOC
2007
ACM
16 years 1 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
81
Voted
CORR
2004
Springer
15 years 20 days ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
105
click to vote
JOTA
2011
14 years 7 months ago
2011
In this paper we consider the linear symmetric cone programming (SCP). At a KarushKuhn-Tucker (KKT) point of SCP, we present the important equivalent conditions for the nonsingula...
121
Voted
ECRTS
2004
IEEE
15 years 4 months ago
2004
IEEE
The problem of feasibility analysis for asynchronous periodic task sets (i.e. where tasks can have an initial offset) is known to be co-NP-complete in the strong sense. A sufficie...
187
Voted
ICDE
2008
IEEE
16 years 2 months ago
2008
IEEE
Data collections often have inconsistencies that arise due to a variety of reasons, and it is desirable to be able to identify and resolve them efficiently. Set similarity queries ...