Sciweavers

2100 search results - page 42 / 420
» Fundamentals of the problem
Sort
View
JDA
2007
83views more  JDA 2007»
13 years 10 months ago
Optimal leaf ordering of complete binary trees
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
Ulrik Brandes
DSS
2002
97views more  DSS 2002»
13 years 10 months ago
A new paradigm for computer-based decision support
We identify and address a fundamental general problem which we regard as crucial for the widespread, effective use of decision support systems (DSS) in the future: how can we subs...
Meurig Beynon, Suwanna Rasmequan, Steve Russ
JACM
2010
135views more  JACM 2010»
13 years 8 months ago
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
Timothy M. Chan
INFOCOM
2006
IEEE
14 years 4 months ago
Super-Fast Delay Tradeoffs for Utility Optimal Fair Scheduling in Wireless Networks
— We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time varying channels. A network controller acts on randomly arriving data ...
Michael J. Neely
WILF
2005
Springer
124views Fuzzy Logic» more  WILF 2005»
14 years 3 months ago
Possibilistic Planning Using Description Logics: A First Step
Abstract. This paper is a first step in the direction of extending possibilistic planning to take advantage of the expressive power and reasoning capabilities of fuzzy description...
Célia da Costa Pereira, Andrea Tettamanzi