Sciweavers

6568 search results - page 1151 / 1314
» Reducing the Complexity of Reductions
Sort
View
ETT
2000
85views Education» more  ETT 2000»
15 years 6 months ago
Simple On-Line Scheduling Algorithms for All-Optical Broadcast-and-Select Networks
This paper considers all-optical broadcast networks providing a number of slotted WDM channels for packet communications. Each network user is equipped with one tunable transmitter...
Marco Ajmone Marsan, Andrea Bianco, Emilio Leonard...
GPEM
2000
121views more  GPEM 2000»
15 years 6 months ago
Bayesian Methods for Efficient Genetic Programming
ct. A Bayesian framework for genetic programming GP is presented. This is motivated by the observation that genetic programming iteratively searches populations of fitter programs ...
Byoung-Tak Zhang
IVC
2000
179views more  IVC 2000»
15 years 6 months ago
A system to place observers on a polyhedral terrain in polynomial time
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
Maurício Marengoni, Bruce A. Draper, Allen ...
JACM
2000
119views more  JACM 2000»
15 years 6 months ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris
JDM
2000
128views more  JDM 2000»
15 years 6 months ago
Distributed Database Design for Mobile Geographical Applications
Advanced Traveler Information Systems (ATIS) require e cient information retrieval and updating in a dynamic environment at di erent geographical scales. ATIS applications are use...
Manhoi Choy, Mei-Po Kwan, Hong Va Leong
« Prev « First page 1151 / 1314 Last » Next »