Sciweavers

29152 search results - page 432 / 5831
» A Model of Computation for MapReduce
Sort
View
COMMA
2008
15 years 9 months ago
A Level-based Approach to Computing Warranted Arguments in Possibilistic Defeasible Logic Programming
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty a...
Teresa Alsinet, Carlos Iván Chesñeva...
OAS
2003
15 years 9 months ago
Using OWL in a Pervasive Computing Broker
Computing is moving toward a pervasive context-aware environment in which agents with limited resources will require external support to help them become context-aware. In this pa...
Harry Chen, Timothy W. Finin, Anupam Joshi
AIPS
1994
15 years 9 months ago
Solving Time-critical Decision-making Problems with Predictable Computational Demands
In this work we present an approach to solving time-critical decision-making problems by taking advantage of domain structure to expand the amountof time available for processing ...
Thomas Dean, Lloyd Greenwald
IAAI
1993
15 years 9 months ago
Computer-Aided Parts Estimation
In 1991 Ford began deployment of the Computer Aided Parts Estimating System (CAPE), a highly advanced knowledge-based system designed to generate, evaluate and cost automotive par...
Adam Cunningham, Robert Smart
CSDA
2008
65views more  CSDA 2008»
15 years 7 months ago
Improving updating rules in multiplicative algorithms for computing D-optimal designs
In this paper we discuss a class of multiplicative algorithms for computing D-optimal designs for regression models on a finite design space. We prove a monotonicity result for a ...
Holger Dette, Andrey Pepelyshev, Anatoly A. Zhiglj...