Sciweavers

1728 search results - page 159 / 346
» Social Computing: Fundamentals and applications
Sort
View
ANOR
2010
102views more  ANOR 2010»
14 years 10 months ago
Ejection chain and filter-and-fan methods in combinatorial optimization
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
César Rego, Fred Glover
VLSID
2007
IEEE
133views VLSI» more  VLSID 2007»
15 years 10 months ago
On the Impact of Address Space Assignment on Performance in Systems-on-Chip
Today, VLSI systems for computationally demanding applications are being built as Systems-on-Chip (SoCs) with a distributed memory sub-system which is shared by a large number of ...
G. Hazari, Madhav P. Desai, H. Kasture
CACM
1999
92views more  CACM 1999»
14 years 9 months ago
Putting OO Distributed Programming to Work
stractions underlying distributed computing. We attempted to keep our preaims at an abstract and general level. In this column, we make those claims more concrete. More precisely, ...
Pascal Felber, Rachid Guerraoui, Mohamed Fayad
HIPC
2005
Springer
15 years 3 months ago
Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric Multiprocessors
Graph theoretic problems are representative of fundamental computations in traditional and emerging scientific disciplines like scientific computing, computational biology and b...
David A. Bader, Kamesh Madduri
SIGITE
2005
ACM
15 years 3 months ago
The role of programming in IT
Early in its history as an academic discipline, depth in computer programming was a primary distinguishing factor between IT and older computing disciplines, such as computer scie...
Dianne P. Bills, John A. Biles