Sciweavers

291 search results - page 9 / 59
» On Generalizing Pawlak Approximation Operators
Sort
View
IPPS
2000
IEEE
14 years 29 days ago
A General Parallel Simulated Annealing Library and its Application in Airline Industry
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
Georg Kliewer, Stefan Tschöke
ADCM
2010
129views more  ADCM 2010»
13 years 8 months ago
Construction of positive definite cubature formulae and approximation of functions via Voronoi tessellations
Let Rd be a compact convex set of positive measure. In a recent paper, we established a definiteness theory for cubature formulae of order two on . Here we study extremal propert...
Allal Guessab, Gerhard Schmeisser
ECAI
2006
Springer
14 years 7 days ago
An Efficient Upper Approximation for Conditional Preference
The fundamental operation of dominance testing, i.e., determining if one alternative is preferred to another, is in general very hard for methods of reasoning with qualitative cond...
Nic Wilson
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 1 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
MOBICOM
1996
ACM
14 years 21 days ago
Reducing Processor Power Consumption by Improving Processor Time Management in a Single-user Operating System
The CPU is one of the major power consumers in a portable computer, and considerable power can be saved by turning off the CPU when it is not doing useful work. In Apple's Ma...
Jacob R. Lorch, Alan Jay Smith