Sciweavers

894 search results - page 133 / 179
» Universal Relations and
Sort
View
APAL
2002
73views more  APAL 2002»
13 years 8 months ago
The sequentially realizable functionals
We consider a notion of sequential functional of finite type, more generous than the familiar notion embodied in Plotkin's language PCF. We study both the "full" an...
John Longley
COMCOM
2004
118views more  COMCOM 2004»
13 years 7 months ago
The next frontier for communications networks: power management
Storage, memory, processor, and communications bandwidth are all relatively plentiful and inexpensive. However, a growing expense in the operation of computer networks is electric...
Kenneth J. Christensen, Chamara Gunaratne, Bruce N...
INFORMS
2000
54views more  INFORMS 2000»
13 years 7 months ago
Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
Marjan van den Akker, Cor A. J. Hurkens, Martin W....
JSCIC
2000
187views more  JSCIC 2000»
13 years 7 months ago
A Boundary Condition Capturing Method for Multiphase Incompressible Flow
In [6], the Ghost Fluid Method (GFM) was developed to capture the boundary conditions at a contact discontinuity in the inviscid compressible Euler equations. In [11], related tec...
Myungjoo Kang, Ronald Fedkiw, Xu-Dong Liu
FUIN
2002
107views more  FUIN 2002»
13 years 7 months ago
Towards an Ontology of Approximate Reason
Abstract. This article introduces structural aspects in an ontology of approximate reason. The basic assumption in this ontology is that approximate reason is a capability of an ag...
James F. Peters, Andrzej Skowron, Jaroslaw Stepani...