Sciweavers

4679 search results - page 134 / 936
» Modeling When Connections Are the Problem
Sort
View
ICDT
2005
ACM
131views Database» more  ICDT 2005»
15 years 7 months ago
Algorithms for the Database Layout Problem
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
CP
2008
Springer
15 years 3 months ago
Elicitation Strategies for Fuzzy Constraint Problems with Missing Preferences: Algorithms and Experimental Studies
Fuzzy constraints are a popular approach to handle preferences and over-constrained problems in scenarios where one needs to be cautious, such as in medical or space applications. ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
JCDL
2005
ACM
95views Education» more  JCDL 2005»
15 years 7 months ago
Resolving the unencoded character problem for chinese digital libraries
Constructing a Chinese digital library, especially for a historical article archiving, is often bothered by the small character sets supported by the current computer systems. Thi...
Derming Juang, Jenq-Haur Wang, Chen-Yu Lai, Ching-...
AI
2010
Springer
15 years 1 months ago
Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
118
Voted
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
15 years 3 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...