1017 search results - page 64 / 204 » Some existence and construction results of polygonal designs |
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
104
click to vote
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
The modular representation of concerns is imperative in the design modeling of multi-agent systems (MASs). However, MAS designers typically face a number of concerns that inherent...
VISSOFT
2005
IEEE
15 years 5 months ago
2005
IEEE
Sequence diagrams are commonly used to represent object interactions in software systems. Reverse-engineered sequence diagrams, which are constructed from existing code, are becom...
JAL
1998
14 years 11 months ago
1998
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
108
click to vote
CRYPTO
2007
Springer
15 years 6 months ago
2007
Springer
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}â...