3495 search results - page 226 / 699 » On the random satisfiable process |
205
click to vote
COMPGEOM
1992
ACM
15 years 11 months ago
1992
ACM
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
273
click to vote
BMCBI
2011
15 years 2 months ago
2011
Background: Molecular database search tools need statistical models to assess the significance for the resulting hits. In the classical approach one asks the question how probable...
180
click to vote
DELTA
2008
IEEE
16 years 1 months ago
2008
IEEE
The classic connected components labelling algorithm requires two passes through an image. This paper presents an algorithm that allows the connected components to be analysed in ...
185
click to vote
ICNP
2007
IEEE
16 years 1 months ago
2007
IEEE
- A Network Court Protocol is designed for malicious node conviction based on information from network node accusing and testifying operations, which are formally modeled by algebr...
204
click to vote
WECWIS
2007
IEEE
16 years 1 months ago
2007
IEEE
When there are a large number of web services available and no single service satisfies the given request, one has to compose multiple web services to fulfill the goal, considerin...