Sciweavers

9842 search results - page 1534 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
UAI
2007
15 years 8 months ago
"I Can Name that Bayesian Network in Two Matrixes!"
The traditional approach to building Bayesian networks is to build the graphical structure using a graphical editor and then add probabilities using a separate spreadsheet for eac...
Russell Almond
WCE
2007
15 years 8 months ago
Sparse Matrix Multiplication Using UPC
—Partitioned global address space (PGAS) languages, such as Unified Parallel C (UPC) have the promise of being productive. Due to the shared address space view that they provide,...
Hoda El-Sayed, Eric Wright
WCE
2007
15 years 8 months ago
A Proactive Horizontal Handover Algorithm for WiFi-WiMax Interoperable Networks
— Two important high bandwidth wireless certifications in our days are Worldwide Interoperability for Microwave Access (WiMax) and Wireless Fidelity (WiFi). They can interoperate...
Álvaro Suárez Sarmiento, Kholoud Elb...
AIIDE
2009
15 years 8 months ago
Using Semantics to Improve the Design of Game Worlds
Design of game worlds is becoming more and more laborintensive because of the increasing demand and complexity of content. This is being partially addressed by developing semi-aut...
Tim Tutenel, Ruben Michaël Smelik, Rafael Bid...
AIPS
2010
15 years 8 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...
« Prev « First page 1534 / 1969 Last » Next »