Sciweavers

1581 search results - page 311 / 317
» Domain semantics of possibility computations
Sort
View
AIPS
2008
14 years 4 days ago
Stochastic Enforced Hill-Climbing
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
Jia-Hong Wu, Rajesh Kalyanam, Robert Givan
DIALM
2005
ACM
130views Algorithms» more  DIALM 2005»
13 years 11 months ago
On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
Frank A. Zdarsky, Ivan Martinovic, Jens B. Schmitt
COMPGEOM
2008
ACM
13 years 11 months ago
Maximum thick paths in static and dynamic environments
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
MBEES
2010
13 years 11 months ago
Towards Architectural Programming of Embedded Systems
: Integrating architectural elements with a modern programming language is essential to ensure a smooth combination of architectural design and programming. In this position statem...
Arne Haber, Jan Oliver Ringert, Bernhard Rumpe
BMCBI
2006
166views more  BMCBI 2006»
13 years 10 months ago
SEQOPTICS: a protein sequence clustering system
Background: Protein sequence clustering has been widely used as a part of the analysis of protein structure and function. In most cases single linkage or graph-based clustering al...
Yonghui Chen, Kevin D. Reilly, Alan P. Sprague, Zh...