8810 search results - page 425 / 1762 » Openness |
127
click to vote
DM
2010
15 years 6 months ago
2010
We say that a hypergraph H is hamiltonian path (cycle) saturated if H does not contain an open (closed) hamiltonian chain but by adding any new edge we create an open (closed) ham...
176
click to vote
DCG
2008
15 years 6 months ago
2008
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
150
click to vote
AAI
2006
15 years 6 months ago
2006
In open societies of agents, where agents are autonomous and heterogeneous, it is not realistic to assume that agents will always act so as to comply to interaction protocols. Thu...
126
click to vote
ENTCS
2006
15 years 6 months ago
2006
We define and use a SOS-based framework to specify the transition systems of calculi with name-passing properties. This setting uses proof-theoretic tools to take care of some of ...
159
click to vote
CE
2007
15 years 6 months ago
2007
Web3D open standards allow the delivery of interactive 3D virtual learning environments through the Internet, reaching potentially large numbers of learners worldwide, at any time...