Sciweavers

3022 search results - page 288 / 605
» Make Way for WayMaker
Sort
View
HEURISTICS
2002
122views more  HEURISTICS 2002»
15 years 6 months ago
Complete Local Search with Memory
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
Diptesh Ghosh, Gerard Sierksma
INFORMATICALT
2002
82views more  INFORMATICALT 2002»
15 years 6 months ago
Data Aggregation Sets in Adaptive Data Model
This article presents the ways of identification, selection and transformation of the data into other structures. Relation selection and transformation may change data quantity and...
Petras Gailutis Adomenas, Algirdas Ciucelis
LOGCOM
1998
110views more  LOGCOM 1998»
15 years 6 months ago
leanTAP Revisited
A sequent calculus of a new sort is extracted from the Prolog program leanTAP. This calculus is sound and complete, even though it lacks almost all structural rules. Thinking of l...
Melvin Fitting
CORR
2010
Springer
127views Education» more  CORR 2010»
15 years 5 months ago
Precisely Analyzing Loss in Interface Adapter Chains
Interface adaptation allows code written for one interface to be used with a software component with another interface. When multiple adapters are chained together to make certain...
Yoo Chung
DBPL
1997
Springer
94views Database» more  DBPL 1997»
15 years 11 months ago
Querying Multidimensional Databases
Abstract. Multidimensional databases are large collections of data, often historical, used for sophisticated analysis oriented to decision making. This activity is supported by an ...
Luca Cabibbo, Riccardo Torlone