808 search results - page 141 / 162 » What Is Answer Set Programming |
112
click to vote
JSYML
1998
15 years 1 months ago
1998
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 ...
126
click to vote
CORR
2010
Springer
15 years 23 days ago
2010
Springer
—In this paper, we present and analyze the properties of a new class of games - the spatial congestion game (SCG), which is a generalization of the classical congestion game (CG)...
130
Voted
TON
2010
14 years 9 months ago
2010
Abstract--In communication networks, multiple disjoint communication paths are desirable for many applications. Such paths, however, may not exist in a network. In such a situation...
121
Voted
HYBRID
2000
Springer
15 years 5 months ago
2000
Springer
In this paper, we formulate the problem of characterizing the stability of a piecewise affine (PWA) system as a verification problem. The basic idea is to take the whole Rn as the ...
145
click to vote
CN
1999
15 years 1 months ago
1999
The rapid growth of the World-Wide Web poses unprecedented scaling challenges for general-purpose crawlers and search engines. In this paper we describe a new hypertext resource d...