4679 search results - page 107 / 936 » Modeling When Connections Are the Problem |
123
Voted
CIBCB
2005
IEEE
15 years 7 months ago
2005
IEEE
— In this paper we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of memetic algori...
110
click to vote
ICAI
2003
15 years 3 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
114
Voted
TAMC
2009
Springer
15 years 8 months ago
2009
Springer
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...
123
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
161
click to vote
CVPR
2009
IEEE
15 years 12 months ago
2009
IEEE
Many vision problems have been formulated as en- ergy minimization problems and there have been signif- icant advances in energy minimization algorithms. The most widely-used energ...