Sciweavers

1480 search results - page 279 / 296
» Ants can solve constraint satisfaction problems
Sort
View
CDC
2008
IEEE
14 years 5 months ago
Convex duality and entropy-based moment closures: Characterizing degenerate densities
A common method for constructing a function from a finite set of moments is to solve a constrained minimization problem. The idea is to find, among all functions with the given ...
Cory D. Hauck, C. David Levermore, André L....
BROADNETS
2005
IEEE
14 years 4 months ago
Optimal path selection for ethernet over SONET under inaccurate link-state information
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
Satyajeet Ahuja, Marwan Krunz, Turgay Korkmaz
MASS
2010
119views Communications» more  MASS 2010»
13 years 8 months ago
Energy-efficient data redistribution in sensor networks
We address the energy-efficient data redistribution problem in data intensive sensor networks (DISNs). The key question in sensor networks with large volumes of sensory data is how...
Bin Tang, Neeraj Jaggi, Haijie Wu, Rohini Kurkal
ICPR
2008
IEEE
15 years 3 days ago
Multiple kernel learning from sets of partially matching image features
Abstract: Kernel classifiers based on Support Vector Machines (SVM) have achieved state-ofthe-art results in several visual classification tasks, however, recent publications and d...
Guo ShengYang, Min Tan, Si-Yao Fu, Zeng-Guang Hou,...
DAC
2003
ACM
14 years 12 months ago
Optimal integer delay budgeting on directed acyclic graphs
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...
Elaheh Bozorgzadeh, Soheil Ghiasi, Atsushi Takahas...