9719 search results - page 295 / 1944 » Answer Set Optimization |
160
Voted
ICMCS
2005
IEEE
16 years 9 days ago
2005
IEEE
It is generally acknowledged that many experts and almost all lay persons have difficulty in formulating requests for information in such a manner that conventional off-line Infor...
180
click to vote
IASTEDCCS
2004
15 years 8 months ago
2004
Unlike the classical deterministic digital circuit analysis, we consider the analysis of uncertain digital circuits defined as follows. Given a binary function of n uncertain inpu...
174
click to vote
JOTA
2011
15 years 1 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...
180
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—We consider the question of obtaining tight delay guarantees for throughout-optimal link scheduling in arbitrary topology wireless ad-hoc networks. We consider two classes of sc...
182
click to vote
FCT
2005
Springer
16 years 7 days ago
2005
Springer
We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, i...