1172 search results - page 150 / 235 » Constructions of generalized Sidon sets |
155
click to vote
EUROCAST
2005
Springer
16 years 4 hour ago
2005
Springer
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
193
click to vote
WAOA
2005
Springer
15 years 12 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
184
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
Agent theories and agent programs are two very different styles of specification of agent behavior. The former are declarative in nature, while the latter have an imperative fl...
174
click to vote
NIPS
1998
15 years 7 months ago
1998
We introduce a semi-supervised support vector machine (S3 VM) method. Given a training set of labeled data and a working set of unlabeled data, S3 VM constructs a support vector m...
184
click to vote
ICFEM
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The success of industrial-scale model checkers such as Uppaal [3] or NuSMV [12] relies on the efficiency of their respective symbolic state space representations. While d...