Sciweavers

1941 search results - page 34 / 389
» On the Hardness of Approximate Reasoning
Sort
View
IWC
2008
53views more  IWC 2008»
14 years 11 months ago
Robot ethics? Not yet: A reflection on Whitby's "Sometimes it's hard to be a robot"
Science fiction stories seductively portray robots as human. In present reality (early 21st century) robots are machines, even though they can do many things far better than human...
Harold W. Thimbleby
FUIN
2006
88views more  FUIN 2006»
14 years 11 months ago
Calculi of Approximation Spaces
This paper considers the problem of how to establish calculi of approximation spaces. Approximation spaces considered in the context of rough sets were introduced by Zdzislaw Pawla...
Andrzej Skowron, Jaroslaw Stepaniuk, James F. Pete...
AAAI
1993
15 years 1 months ago
Model Simplification by Asymptotic Order of Magnitude Reasoning
One of the hardest problems in reasoning about a physical system is finding an approximate model that is mathematically tractable and yet captures the essence of the problem. Appr...
Kenneth Man-kam Yip
CPAIOR
2007
Springer
15 years 6 months ago
Connections in Networks: Hardness of Feasibility Versus Optimality
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
Jon Conrad, Carla P. Gomes, Willem Jan van Hoeve, ...
TRANSCI
2002
106views more  TRANSCI 2002»
14 years 11 months ago
The Stochastic Inventory Routing Problem with Direct Deliveries
Vendor managed inventory replenishment is a business practice in which vendors monitor their customers' inventories, and decide when and how much inventory should be replenis...
Anton J. Kleywegt, Vijay S. Nori, Martin W. P. Sav...