Sciweavers

2536 search results - page 426 / 508
» Constructing Optimal Highways
Sort
View
ML
2007
ACM
101views Machine Learning» more  ML 2007»
13 years 9 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre
SCHEDULING
2008
112views more  SCHEDULING 2008»
13 years 9 months ago
Time-constrained project scheduling
We propose a new approach for scheduling with strict deadlines and apply this approach to the TimeConstrained Project Scheduling Problem (TCPSP). To be able to meet these deadlines...
T. A. Guldemond, Johann Hurink, Jacob Jan Paulus, ...
TSP
2008
134views more  TSP 2008»
13 years 9 months ago
A Mapping-Based Design for Nonsubsampled Hourglass Filter Banks in Arbitrary Dimensions
Multidimensional hourglass filter banks decompose the frequency spectrum of input signals into hourglass-shaped directional subbands, each aligned with one of the frequency axes. T...
Yue M. Lu, Minh N. Do
ICSOC
2010
Springer
13 years 8 months ago
From Quality to Utility: Adaptive Service Selection Framework
Abstract. We consider an approach to service selection wherein service consumers choose services with desired nonfunctional properties to maximize their utility. A consumer’s uti...
Chung-Wei Hang, Munindar P. Singh
JAPLL
2010
179views more  JAPLL 2010»
13 years 8 months ago
Tractable query answering and rewriting under description logic constraints
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
Héctor Pérez-Urbina, Boris Motik, Ia...