1632 search results - page 30 / 327 » On special numberings of hypergraphs |
153
click to vote
EOR
2007
15 years 6 months ago
2007
Consider a single machine and a set of jobs that are available for processing at time 0. Job ¡ has a processing time ¢¤£ , a due date ¥¦£ and a weight §¨£ . We consid...
160
click to vote
AAIM
2005
Springer
15 years 8 months ago
2005
Springer
In this paper, we study how to, given a set of pre-routed requests in an all-optical network and a set of wavelengths available on each link, assign a subset of requests with maxim...
160
click to vote
ARITH
2009
IEEE
16 years 1 months ago
2009
IEEE
—The real Logarithmic Number System (LNS) allows fast and inexpensive multiplication and division but more expensive addition and subtraction as precision increases. Recent advan...
170
click to vote
DM
2006
15 years 6 months ago
2006
Let F1, F2, . . . , Fk be graphs with the same vertex set V . A subset S V is a factor dominating set if in every Fi every vertex not in S is adjacent to a vertex in S, and a fac...
143
click to vote
ALT
2007
Springer
16 years 3 months ago
2007
Springer
In this paper we consider learnability in some special numberings, such as Friedberg numberings, which contain all the recursively enumerable languages, but have simpler grammar e...