Sciweavers

4377 search results - page 95 / 876
» Mass problems and randomness
Sort
View
SIAMAM
2008
79views more  SIAMAM 2008»
15 years 5 months ago
Transport-Based Imaging in Random Media
This paper generalizes well-established derivations of the radiative transfer equation from first principles to model the energy density of time-dependent and monochromatic high f...
Guillaume Bal, Kui Ren
BIRTHDAY
2009
Springer
16 years 8 days ago
Combinatorial Problems for Horn Clauses
Given a family of Horn clauses, what is the minimal number of Horn clauses implying all other clauses in the family? What is the maximal number of Horn clauses from the family wit...
Marina Langlois, Dhruv Mubayi, Robert H. Sloan, Gy...
143
Voted
ISCAS
2005
IEEE
114views Hardware» more  ISCAS 2005»
15 years 11 months ago
Structured stochastic optimization strategies for problems with ill-conditioned error surfaces
—This paper compares the performance of several structured optimization strategies in adaptive signal processing problems that are characterized by ill-conditioned error surfaces...
S. Pal, Dean J. Krusienski, W. Kenneth Jenkins
ETFA
2008
IEEE
15 years 7 months ago
Descending Deviation Optimization techniques for scheduling problems
In factory automation, production line scheduling entails a number of competing issues. Finding optimal configurations often requires use of local search techniques. Local search l...
Kevin McCarty, Milos Manic
CORR
2008
Springer
110views Education» more  CORR 2008»
15 years 5 months ago
Finding Dense Subgraphs in G(n,1/2)
Finding the largest clique in random graphs is a well known hard problem. It is known that a random graph G(n, 1/2) almost surely has a clique of size about 2 log n. A simple greed...
Atish Das Sarma, Amit Deshpande, Ravi Kannan