2446 search results - page 286 / 490 » Choiceless Polynomial Time |
SEMWEB
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We study the problem of evolution for Knowledge Bases (KBs) expressed in Description Logics (DLs) of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the t...
WINE
2010
Springer
13 years 5 months ago
2010
Springer
The Shapley Value is arguably the most important normative solution concept in coalitional games. One of its applications is in the domain of networks, where the Shapley Value is u...
FOCS
2009
IEEE
13 years 5 months ago
2009
IEEE
We give a new model of learning motivated by smoothed analysis (Spielman and Teng, 2001). In this model, we analyze two new algorithms, for PAC-learning DNFs and agnostically learn...
ICC
2009
IEEE
13 years 5 months ago
2009
IEEE
Abstract-- This paper addresses the problem of traffic grooming in WDM rings in which all traffic emanates from a single node and all other nodes are destination nodes. This "...
ICCAD
2009
IEEE
13 years 5 months ago
2009
IEEE
Wire bonding is the most popular method to connect signals between dies in System-in-Package (SiP) design nowadays. Pad assignment, which assigns inter-die signals to die pads so ...