Sciweavers

3495 search results - page 401 / 699
» On the random satisfiable process
Sort
View
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
16 years 1 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
ICMI
2009
Springer
147views Biometrics» more  ICMI 2009»
16 years 1 months ago
Multimodal end-of-turn prediction in multi-party meetings
One of many skills required to engage properly in a conversation is to know the appropiate use of the rules of engagement. In order to engage properly in a conversation, a virtual...
Iwan de Kok, Dirk Heylen
NETCOOP
2009
Springer
16 years 1 months ago
Probabilistic Analysis of Hierarchical Cluster Protocols for Wireless Sensor Networks
Wireless sensor networks are designed to extract data from the deployment environment and combine sensing, data processing and wireless communication to provide useful information ...
Ingemar Kaj
WCNC
2008
IEEE
16 years 1 months ago
Relay-Assisted ARQ in Wireless Ad-Hoc Networks
— In this paper we study a simple protocol utilizing two-hop cooperative diversity augmented with “automatic repeat request” (ARQ) for multi-hop ad-hoc networks. This protoco...
Furuzan Atay Onat, Dan Avidor
CCGRID
2007
IEEE
16 years 1 months ago
Scheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research
While a grid represents a computing infrastructure for cross domain sharing of computational resources, the cyberinfrastructure, proposed by the US NSF Blue – Ribbon advisory pa...
Jie Yin, Junwei Cao, Yuexuan Wang, Lianchen Liu, C...