1547 search results - page 189 / 310 » Solving Knapsack Problems in a Sticker Based Model |
127
click to vote
EUROPAR
2004
Springer
15 years 8 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
127
Voted
GLOBECOM
2008
IEEE
2008
IEEE
Network Planning for Next-Generation Metropolitan-Area Broadband Access under EPON-WiMAX Integration
15 years 3 months ago
Abstract--This paper tackles a fundamental problem of network planning and dimensioning under EPON-WiMAX integration for next-generation wireless metropolitan-area broadband access...
151
Voted
ENTCS
2006
15 years 3 months ago
2006
While a lot of progress has been made in improving analyses and tools that aid software development, less effort has been spent on studying how such tools are commonly used in pra...
131
Voted
IJIT
2004
15 years 4 months ago
2004
This paper reports work done to improve the modeling of complex processes when only small experimental data sets are available. Neural networks are used to capture the nonlinear un...
127
click to vote
AGTIVE
2003
Springer
15 years 8 months ago
2003
Springer
OptimixJ is a graph rewrite tool that can be embedded easily into the standard software process. Applications and models can be developed in Java or UML and extended by graph rewri...