Sciweavers

2095 search results - page 379 / 419
» Improved pebbling bounds
Sort
View
CONSTRAINTS
2007
112views more  CONSTRAINTS 2007»
13 years 10 months ago
Maxx: Test Pattern Optimisation with Local Search Over an Extended Logic
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
Francisco Azevedo
JSAC
2006
146views more  JSAC 2006»
13 years 9 months ago
Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks
Multihop infrastructure wireless mesh networks offer increased reliability, coverage, and reduced equipment costs over their single-hop counterpart, wireless local area networks. E...
Mansoor Alicherry, Randeep Bhatia, Erran L. Li
JSAC
2007
78views more  JSAC 2007»
13 years 9 months ago
Partially Optimal Routing
— Most large-scale communication networks, such as the Internet, consist of interconnected administrative domains. While source (or selfish) routing, where transmission follows ...
Daron Acemoglu, Ramesh Johari, Asuman E. Ozdaglar
BMCBI
2004
176views more  BMCBI 2004»
13 years 9 months ago
Boosting accuracy of automated classification of fluorescence microscope images for location proteomics
Background: Detailed knowledge of the subcellular location of each expressed protein is critical to a full understanding of its function. Fluorescence microscopy, in combination w...
Kai Huang, Robert F. Murphy
MP
2002
176views more  MP 2002»
13 years 9 months ago
UOBYQA: unconstrained optimization by quadratic approximation
UOBYQA is a new algorithm for general unconstrained optimization calculations, that takes account of the curvature of the objective function, F say, by forming quadratic models by ...
M. J. D. Powell