Sciweavers

5804 search results - page 1137 / 1161
» Doing more with less
Sort
View
KI
2002
Springer
14 years 11 months ago
Description Logics for the Semantic Web
The vision of a Semantic Web has recently drawn considerable attention, both from academia and industry. Description Logics are often named as one of the tools that can support th...
Franz Baader, Ian Horrocks, Ulrike Sattler
MICRO
2002
IEEE
156views Hardware» more  MICRO 2002»
14 years 11 months ago
TCP Switching: Exposing Circuits to IP
There has been much discussion about the best way to combine the benefits of new optical circuit switching technology with the established packet switched Internet. In this paper,...
Pablo Molinero-Fernández, Nick McKeown
JSYML
1998
61views more  JSYML 1998»
14 years 11 months ago
Superdestructibility: A Dual to Laver's Indestructibility
Abstract. After small forcing, any <κ-closed forcing will destroy the supercompactness and even the strong compactness of κ. In a delightful argument, Laver [L78] proved that ...
Joel David Hamkins, Saharon Shelah
MP
2002
165views more  MP 2002»
14 years 11 months ago
A feasible semismooth asymptotically Newton method for mixed complementarity problems
Semismooth Newton methods constitute a major research area for solving mixed complementarity problems (MCPs). Early research on semismooth Newton methods is mainly on infeasible me...
Defeng Sun, Robert S. Womersley, Houduo Qi
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
14 years 11 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch
« Prev « First page 1137 / 1161 Last » Next »