2845 search results - page 176 / 569 » Constraints over Ontologies |
146
click to vote
HT
2005
ACM
16 years 5 days ago
2005
ACM
People have become used to paper as an information carrier over thousands of years. Paper is usually easy to handle and has been adopted as a metaphor for information structures i...
165
click to vote
APWEB
2004
Springer
16 years 4 hour ago
2004
Springer
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...
153
click to vote
SC
2003
ACM
15 years 12 months ago
2003
ACM
We present a novel approach for decomposing contact/impact computations in which the mesh elements come in contact with each other during the course of the simulation. Effective d...
166
click to vote
SAS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
165
click to vote
INFOCOM
1998
IEEE
1998
IEEE
Performance Bounds for Dynamic Channel Assignment Schemes Operating under Varying Re-Use Constraints
15 years 11 months ago
-We derive bounds for the performance of dynamic channel assignment (DCA) schemeswhich strengthenthe existing Erlang bound. The construction of the bounds is based on a reward para...