1801 search results - page 164 / 361 » Pointing without a pointer |
SIAMJO
2008
14 years 10 months ago
2008
It is known that the Karush-Kuhn-Tucker (KKT) conditions of semidefinite programming can be reformulated as a nonsmooth system via the metric projector over the cone of symmetric ...
STTT
2008
14 years 10 months ago
2008
Explicit model checking algorithms explore the full state space of a system. State spaces are usually treated as directed graphs without any specific features. We gather a large co...
AICOM
2004
14 years 10 months ago
2004
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
118
click to vote
CSI
2004
14 years 10 months ago
2004
Due to the popularity of electronic commerce and the maturity of wireless technology, mobile users can access the Internet anytime anywhere without having to physically hook up an...
CCR
2000
14 years 10 months ago
2000
We propose an enhancement to TCP's error recovery scheme, which we call the Eifel algorithm. It eliminates the retransmission ambiguity, thereby solving the problems caused b...