Sciweavers

7103 search results - page 1045 / 1421
» Program Generation and Components
Sort
View
JDA
2006
85views more  JDA 2006»
15 years 4 months ago
Average case analysis of DJ graphs
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
Johann Blieberger
JEC
2006
90views more  JEC 2006»
15 years 4 months ago
The impact of traffic aggregation on the memory performance of networking applications
The trend of the networking processing is to increase the intelligence of the routers (i.e. security capacities). This means that there is an increment in the workload generated p...
Javier Verdú, Jorge García-Vidal, Ma...
KI
2008
Springer
15 years 4 months ago
Repairing Decision-Theoretic Policies Using Goal-Oriented Planning
In this paper we address the problem of how decision-theoretic policies can be repaired. This work is motivated by observations made in robotic soccer where decisiontheoretic polic...
Christoph Mies, Alexander Ferrein, Gerhard Lakemey...
JSW
2006
92views more  JSW 2006»
15 years 4 months ago
Design a Jini-based Service Broker for Dynamic Service Combination Framework
The increased use of electronic service has invented a new term Service-Oriented Architecture. In a typical distributed environment consisting of many independent devices and servi...
Kuo-Wei Hsu
MP
2008
105views more  MP 2008»
15 years 4 months ago
On the strength of Gomory mixed-integer cuts as group cuts
Gomory mixed-integer (GMI) cuts generated from optimal simplex tableaus are known to be useful in solving mixed-integer programs. Further, it is well-known that GMI cuts can be de...
Sanjeeb Dash, Oktay Günlük
« Prev « First page 1045 / 1421 Last » Next »