3663 search results - page 401 / 733 » Problems in the ontology of computer programs |
161
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
162
click to vote
CP
2009
Springer
16 years 1 months ago
2009
Springer
The Maximum Density Sill-Life Problem is to fill an n × n board of cells with the maximum number of live cells so that the board is stable under the rules of Conway’s Game of L...
212
click to vote
ICC
2008
IEEE
16 years 1 months ago
2008
IEEE
—It is not possible to ensure that a network is absolutely secure. Therefore, network operators must continually change their defense strategies to counter attackers who constant...
145
click to vote
ECSQARU
2007
Springer
16 years 29 days ago
2007
Springer
Abstract. The problem of averaging outcomes under several scenarios to form overall objective functions is of considerable importance in decision support under uncertainty. The fuz...
186
click to vote
WMTE
2006
IEEE
16 years 24 days ago
2006
IEEE
Teachers working in robotics classes face a major problem: how to keep track on individual students’ or even small groups’ progress in a class of 30-40 students. A multi-agent...