Sciweavers

372 search results - page 3 / 75
» A Study of The Fragile Base Class Problem
Sort
View
84
Voted
CORR
2011
Springer
126views Education» more  CORR 2011»
14 years 1 months ago
New Polynomial Classes for Logic-Based Abduction
We address the problem of propositional logic-based abduction, i.e., the problem of searching for a best explanation for a given propositional observation according to a given pro...
Bruno Zanuttini
CVPR
2009
IEEE
16 years 5 months ago
Learning To Detect Unseen Object Classes by Between-Class Attribute Transfer
We study the problem of object classification when training and test classes are disjoint, i.e. no training examples of the target classes are available. This setup has hardly be...
Christoph H. Lampert, Hannes Nickisch, Stefan Harm...
COCOA
2008
Springer
14 years 11 months ago
Computational Study on Dominating Set Problem of Planar Graphs
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
Marjan Marzban, Qian-Ping Gu, Xiaohua Jia
MP
1998
117views more  MP 1998»
14 years 9 months ago
The node capacitated graph partitioning problem: A computational study
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
Carlos Eduardo Ferreira, Alexander Martin, C. Carv...
XPU
2007
Springer
15 years 3 months ago
Empirical Evidence Principle and Joint Engagement Practice to Introduce XP
Bringing software process change to an organisation is a real challenge. The authors have shown a sample attempt to carry out a process change and then reflected on its results and...
Lech Madeyski, Wojciech Biela