753 search results - page 43 / 151 » Completing a (k - 1)-Assignment |
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
PN refer to the set of ties a specific individual has with other people. There is significant variation in the size of an individual’s PN and this paper explores the effect o...
TARK
2005
Springer
15 years 3 months ago
2005
Springer
The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighb...
CSR
2008
Springer
14 years 11 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
207
click to vote
COMPGEOM
2011
ACM
14 years 1 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
IOR
2002
14 years 9 months ago
2002
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...