Sciweavers

4047 search results - page 338 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
CIAC
2003
Springer
98views Algorithms» more  CIAC 2003»
15 years 12 months ago
Improving Customer Proximity to Railway Stations
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
Evangelos Kranakis, Paolo Penna, Konrad Schlude, D...
ISAAC
2009
Springer
78views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Reconstructing Polygons from Scanner Data
A range-finding scanner can collect information about the shape of an (unknown) polygonal room in which it is placed. Suppose that a set of scanners returns not only a set of poin...
Therese C. Biedl, Stephane Durocher, Jack Snoeyink
CC
2005
Springer
115views System Software» more  CC 2005»
16 years 4 days ago
Experiences with Enumeration of Integer Projections of Parametric Polytopes
Abstract. Many compiler optimization techniques depend on the ability to calculate the number of integer values that satisfy a given set of linear constraints. This count (the enum...
Sven Verdoolaege, Kristof Beyls, Maurice Bruynoogh...
GECCO
2004
Springer
15 years 12 months ago
Dynamic Uniform Scaling for Multiobjective Genetic Algorithms
Before Multiobjective EvolutionaryAlgorithms (MOEAs) can be used as a widespread tool for solving arbitrary real world problems there are some salient issues which require further ...
Gerulf K. M. Pedersen, David E. Goldberg
BIRTHDAY
2004
Springer
15 years 10 months ago
On Models for Quantified Boolean Formulas
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...
Hans Kleine Büning, Xishun Zhao