Sciweavers

576 search results - page 60 / 116
» Matching methodology to problem domain
Sort
View
CPHYSICS
2011
271views Education» more  CPHYSICS 2011»
13 years 7 days ago
A dedicated algorithm for calculating ground states for the triangular random bond Ising model
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. T...
O. Melchert, A. K. Hartmann
TASE
2010
IEEE
13 years 3 months ago
A Semantic Feature Model in Concurrent Engineering
Concurrent engineering (CE) is a methodology applied to product lifecycle development so that high quality, well designed products can be provided at lower prices and in less time....
Yong-Jin Liu, Kam-Lung Lai, Gang Dai, Matthew Ming...
KDD
2002
ACM
197views Data Mining» more  KDD 2002»
14 years 9 months ago
SimRank: a measure of structural-context similarity
The problem of measuring "similarity" of objects arises in many applications, and many domain-specific measures have been developed, e.g., matching text across documents...
Glen Jeh, Jennifer Widom
HPCC
2007
Springer
14 years 2 months ago
Multi-domain Topology-Aware Grouping for Application-Layer Multicast
Application-layer multicast (ALM) can solve most of the problems of IP-based multicast. Topology-aware approach of ALM is more attractive because it exploits underlying network top...
Jianqun Cui, Yanxiang He, Libing Wu, Naixue Xiong,...
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
14 years 9 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...