Sciweavers

4679 search results - page 3 / 936
» Modeling When Connections Are the Problem
Sort
View
JSAT
2006
109views more  JSAT 2006»
13 years 5 months ago
Decomposing SAT Problems into Connected Components
Many SAT instances can be decomposed into connected components either initially after preprocessing or during the solution phase when new unit conflict clauses are learned. This o...
Armin Biere, Carsten Sinz
PE
2002
Springer
137views Optimization» more  PE 2002»
13 years 4 months ago
Analysis of two competing TCP/IP connections
Many mathematical models exist for describing the behavior of TCP/IP (TCP: transmission control protocol) under an exogenous loss process that does not depend on the window size. ...
Eitan Altman, Tania Jiménez, R. Nú&n...
CVPR
1999
IEEE
14 years 7 months ago
High-Level and Generic Models for Visual Search: When Does High Level Knowledge Help?
We analyze the problem of detecting a road target in background clutter and investigate the amount of prior (i.e. target specific) knowledge needed to perform this search task. Th...
Alan L. Yuille, James M. Coughlan
SIGMETRICS
2010
ACM
214views Hardware» more  SIGMETRICS 2010»
13 years 10 months ago
Distributed sensor network localization from local connectivity: performance analysis for the HOP-TERRAIN algorithm
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
Amin Karbasi, Sewoong Oh
CORR
2011
Springer
178views Education» more  CORR 2011»
12 years 8 months ago
Message and State Cooperation in a Relay Channel When the Relay Has Strictly Causal State Information
—A state-dependent relay channel is studied in which strictly causal channel state information is available at the relay and no state information is available at the source and d...
Min Li, Osvaldo Simeone, Aylin Yener