16504 search results - page 195 / 3301 » New Problems, New Solutions |
164
click to vote
VL
1995
IEEE
15 years 10 months ago
1995
IEEE
A critical incident is reported where a discretionary user needed to partition the spreadsheet grid into an arithmetic series of blocks and apply a function to each, but was unabl...
145
click to vote
PUK
2003
15 years 7 months ago
2003
Planning is known to be a difficult task. One of the approaches used to reduce this difficulty is problem decomposition under divide-and-conquer methodology. This paper introduce...
221
click to vote
MMS
1998
15 years 6 months ago
1998
This paper explores the problems associated with the multicasting of continuous media to support multimedia group applications. The interaction between multicasting and the deliver...
210
click to vote
TEC
2002
15 years 6 months ago
2002
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
162
click to vote
IEEECIT
2010
IEEE
15 years 5 months ago
2010
IEEE
—As we all know, Hanoi Problem is a classical case of recursive algorithm in programming. In this paper, we study the problem in another way by numbering the peg from bottom to t...