Sciweavers

2125 search results - page 159 / 425
» Points with Type-2 Operations
Sort
View
169
Voted
DALT
2005
Springer
15 years 9 months ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki
120
Voted
ICS
2005
Tsinghua U.
15 years 9 months ago
Improving the computational intensity of unstructured mesh applications
Although unstructured mesh algorithms are a popular means of solving problems across a broad range of disciplines—from texture mapping to computational fluid dynamics—they ar...
Brian S. White, Sally A. McKee, Bronis R. de Supin...
108
Voted
SIGOPSE
2004
ACM
15 years 9 months ago
QoS for internet services: done right
In this paper we argue that the best approach to providing Quality of Service (QoS) guarantees to current Internet services is to use admission control and traffic shaping techni...
Josep M. Blanquer, Antoni Batchelli, Klaus E. Scha...
145
Voted
CC
2004
Springer
177views System Software» more  CC 2004»
15 years 9 months ago
Value-Based Partial Redundancy Elimination
Abstract. Partial redundancy elimination (PRE) is a program transformation that identifies and eliminates expressions that are redundant on at least one (but not necessarily all) ...
Thomas VanDrunen, Antony L. Hosking
DEON
2004
Springer
15 years 9 months ago
Designing a Deontic Logic of Deadlines
This paper studies the logic of a dyadic modal operator for being obliged to meet a condition ρ before a condition δ becomes true. Starting from basic intuitions we arrive at a s...
Jan Broersen, Frank Dignum, Virginia Dignum, John-...