11565 search results - page 2002 / 2313 » Computing Minimal Mappings |
182
click to vote
ICTAI
2010
IEEE
15 years 4 months ago
2010
IEEE
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
189
click to vote
IEEEHPCS
2010
15 years 4 months ago
2010
In this paper we analyze the performance of execution of service workflows in virtual machines (VMs) used as resources in our service-oriented grid testbed (SGT). We chosen an app...
183
click to vote
IMC
2010
ACM
15 years 4 months ago
2010
ACM
Previous methods of network anomaly detection have focused on defining a temporal model of what is "normal," and flagging the "abnormal" activity that does not...
218
Voted
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
184
click to vote
ITS
2010
Springer
15 years 4 months ago
2010
Springer
Mily's World is a learning environment for coordinate geometry that has game-like properties, that is, elements of games that are engaging such as cover story, graphical repre...