8486 search results - page 1326 / 1698 » Ordered Enumeration Method |
174
click to vote
ICLP
2005
Springer
16 years 9 days ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
179
click to vote
ICN
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. Many studies explored the guaranteed TCP throughput problem in DiffServ networks. Several new marking schemes have been proposed in order to solve this problem. Even if ...
150
click to vote
ICNC
2005
Springer
16 years 9 days ago
2005
Springer
This paper proposes an improved genetic algorithm for producing aesthetically pleasing drawings of general undirected graphs. Previous undirected graph drawing algorithms draw larg...
176
Voted
IEAAIE
2005
Springer
16 years 9 days ago
2005
Springer
The discovery of new and potentially meaningful relationships between concepts in the biomedical literature has attracted the attention of a lot of researchers in text mining. The ...
195
click to vote
IFIP
2005
Springer
16 years 9 days ago
2005
Springer
A new quasi-Newton scheme for updating a low rank positive semi-definite Hessian approximation is described, primarily for use in sequential quadratic programming methods for non...