Sciweavers

2343 search results - page 164 / 469
» Visual-Concept Search Solved
Sort
View
MP
2008
129views more  MP 2008»
15 years 4 months ago
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
Florian A. Potra
145
Voted
IJCGA
2010
99views more  IJCGA 2010»
15 years 3 months ago
Finding All Door Locations that Make a Room Searchable
—A room is a simple polygon with a prespecified point, called the door, on its boundary. Search may be conducted by two guards on the boundary who keep mutual visibility at all ...
Tsunehiko Kameda, John Z. Zhang
172
Voted
EOR
2010
104views more  EOR 2010»
15 years 2 months ago
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
Fatih Safa Erenay, Ihsan Sabuncuoglu, Aysegül...
ECIR
2011
Springer
14 years 8 months ago
Visual Exploration of Health Information for Children
Abstract. Children experience several difficulties retrieving information using current Information Retrieval (IR) systems. Particularly, children struggle to find the right keywo...
Frans van der Sluis, Sergio Duarte Torres, Djoerd ...
PROCEDIA
2011
14 years 7 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff