Sciweavers

11740 search results - page 2032 / 2348
» More Problems in Rewriting
Sort
View
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
15 years 10 months ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen
JELIA
1990
Springer
15 years 10 months ago
Semantic Interpretation as Higher-Order Deduction
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
Fernando C. N. Pereira
ANCS
2007
ACM
15 years 10 months ago
On LID assignment in infiniBand networks
To realize a path in an InfiniBand network, an address, known as Local IDentifier (LID) in the InfiniBand specification, must be assigned to the destination and used in the forwar...
Wickus Nienaber, Xin Yuan, Zhenhai Duan
AOSD
2007
ACM
15 years 10 months ago
Aspect-oriented application-level scheduling for J2EE servers
Achieving sufficient execution performance is a challenging goal of software development. Unfortunately, violating performance requirements is often revealed at a late stage of th...
Kenichi Kourai, Hideaki Hibino, Shigeru Chiba
218
Voted
ARGMAS
2007
Springer
15 years 10 months ago
Arguing and Explaining Classifications
Argumentation is a promising approach used by autonomous agents for reasoning about inconsistent knowledge, based on the construction and the comparison of arguments. In this pape...
Leila Amgoud, Mathieu Serrurier
« Prev « First page 2032 / 2348 Last » Next »