Sciweavers

656 search results - page 112 / 132
» Minimal non-convex words
Sort
View
JUCS
2008
130views more  JUCS 2008»
14 years 9 months ago
Experimenting the Automated Selection of COTS Components Based on Cost and System Requirements
: In a component-based development process the selection of components is an activity that takes place over multiple lifecycle phases that span from requirement specifications thro...
Vittorio Cortellessa, Ivica Crnkovic, Fabrizio Mar...
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
14 years 9 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...
MP
2002
165views more  MP 2002»
14 years 9 months ago
A feasible semismooth asymptotically Newton method for mixed complementarity problems
Semismooth Newton methods constitute a major research area for solving mixed complementarity problems (MCPs). Early research on semismooth Newton methods is mainly on infeasible me...
Defeng Sun, Robert S. Womersley, Houduo Qi
COMCOM
2010
131views more  COMCOM 2010»
14 years 8 months ago
Level the buffer wall: Fair channel assignment in wireless sensor networks
—In this paper, we study the trade-off between network throughput and fairness in a multi-channel enabled WSN. Traditional approaches attempt to solve the two problems in an isol...
Yanyan Yang, Yunhuai Liu, Lionel M. Ni
FOCM
2010
108views more  FOCM 2010»
14 years 8 months ago
Iterative Thresholding Meets Free-Discontinuity Problems
Free-discontinuity problems describe situations where the solution of interest is defined by a function and a lower dimensional set consisting of the discontinuities of the funct...
Massimo Fornasier, Rachel Ward