2008 |
84 | EE | Masaya Mito,
Satoshi Fujita:
Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction.
COCOON 2008: 425-433 |
83 | EE | Yuichi Asahiro,
Satoshi Fujita,
Ichiro Suzuki,
Masafumi Yamashita:
A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots.
OPODIS 2008: 125-144 |
82 | | Tatsuya Tokunaga,
Satoshi Fujita:
Dynamic and Secure User Management in Networked Consumer Electronics.
PDPTA 2008: 451-457 |
81 | | Satoshi Fujita,
Shigeaki Tagashira:
A Barrier Synchronization Protocol for Broadcast Networks Based on Dynamic Access Control.
PDPTA 2008: 83-88 |
80 | EE | Satoshi Fujita:
Vertex Domination in Dynamic Networks.
WALCOM 2008: 1-12 |
79 | EE | Shigeaki Tagashira,
Masahiro Yamane,
Satoshi Fujita:
An Efficient Scheduling Scheme for Assigning Transmission Opportunity in QoS-Guaranteed Wireless LAN.
IEICE Transactions 91-A(7): 1562-1569 (2008) |
78 | EE | Koji Kobatake,
Shigeaki Tagashira,
Satoshi Fujita:
A New Caching Technique to Support Conjunctive Queries in P2P DHT.
IEICE Transactions 91-D(4): 1023-1031 (2008) |
2007 |
77 | EE | XiaoRan Wang,
Shigeaki Tagashira,
Satoshi Fujita:
FDAR: A Load-Balanced Routing Scheme for Mobile Ad-Hoc Networks.
ADHOC-NOW 2007: 186-197 |
76 | | Wei Liu,
Shigeaki Tagashira,
Satoshi Fujita:
SwRED: A Robust Active Queue Management Scheme based on Load Level Prediction.
PDPTA 2007: 336-341 |
75 | | Akira Ohtsubo,
Shigeaki Tagashira,
Satoshi Fujita:
A content addressable small-world network.
Parallel and Distributed Computing and Networks 2007: 194-199 |
74 | | Kouta Maruyama,
Shigeaki Tagashira,
Satoshi Fujita:
A P2P information monitoring system supporting conjunctive continual queries.
Parallel and Distributed Computing and Networks 2007: 355-360 |
73 | EE | Satoshi Fujita,
Akira Ohtsubo,
Masaya Mito:
Extended Skip Graphs for Efficient Key Search in Peer-to-Peer Environment.
Journal of Interconnection Networks 8(2): 119-132 (2007) |
2006 |
72 | EE | Masahiro Yamane,
Shigeaki Tagashira,
Satoshi Fujita:
An Efficient Assignment of Transmission Opportunity in QoS Guaranteed Wireless LAN.
PDCAT 2006: 105-108 |
71 | EE | Ken'ichi Yasuda,
Shigeaki Tagashira,
Satoshi Fujita:
Adaptive MAC Scheme for Wireless LAN Based on Dynamic Group Constructions.
PDCAT 2006: 300-305 |
70 | EE | Satoshi Fujita:
Special Section on Discrete Mathematics and Its Applications.
IEICE Transactions 89-A(5): 1159 (2006) |
69 | EE | Shigeaki Tagashira,
Syuhei Shirakawa,
Satoshi Fujita:
Proxy-Based Index Caching for Content-Addressable Networks.
IEICE Transactions 89-D(2): 555-562 (2006) |
68 | EE | Hiroyuki Ochi,
Shigeaki Tagashira,
Satoshi Fujita:
A Localization Scheme for Sensor Networks Based on Wireless Communication with Anchor Groups.
IEICE Transactions 89-D(5): 1614-1621 (2006) |
67 | EE | Daisuke Takemoto,
Shigeaki Tagashira,
Satoshi Fujita:
A Fault-Tolerant Content Addressable Network.
IEICE Transactions 89-D(6): 1923-1930 (2006) |
66 | EE | Shigeaki Tagashira,
Masaya Mito,
Satoshi Fujita:
A Generic Solver Based on Functional Parallelism for Solving Combinatorial Optimization Problems.
IEICE Transactions 89-D(6): 1940-1947 (2006) |
2005 |
65 | EE | Tang Tao,
Shigeaki Tagashira,
Satoshi Fujita:
LQ-Routing Protocol for Mobile Ad-Hoc Networks.
ACIS-ICIS 2005: 441-446 |
64 | EE | Satoshi Fujita,
Shigeaki Tagashira,
Chen Qiao,
Masaya Mito:
Distributed Branch-and-Bound Scheme for Solving the Winner Determination Problem in Combinatorial Auctions.
AINA 2005: 661-666 |
63 | EE | Hiroyuki Ochi,
Shigeaki Tagashira,
Satoshi Fujita:
A Localization Scheme for Sensor Networks based onWireless Communication with Anchor Groups.
ICPADS (1) 2005: 299-305 |
62 | EE | Satoshi Fujita:
A Tight Bound on the Number of Mobile Servers to Guarantee the Mutual Transferability Among Dominating Configurations.
ISAAC 2005: 563-572 |
61 | EE | Daisuke Takemoto,
Shigeaki Tagashira,
Satoshi Fujita:
A Fault-Tolerant Content Addressable Network.
ISPA 2005: 792-803 |
60 | EE | Satoshi Fujita,
Akira Ohtsubo,
Masaya Mito:
Extended Skip Graphs for Efficient Key Search in P2P Environment.
ISPAN 2005: 256-261 |
59 | | Satoshi Fujita:
A Note on Efficient Key Location in Pure P2P Systems Under an Environment with Dynamic Key Modifications.
Parallel and Distributed Computing and Networks 2005: 669-673 |
58 | EE | Hiroshi Osada,
Satoshi Fujita:
CHQ: A Multi-Agent Reinforcement Learning Scheme for Partially Observable Markov Decision Processes.
IEICE Transactions 88-D(5): 1004-1011 (2005) |
2004 |
57 | EE | Akira Ohtsubo,
Daisuke Takemoto,
Shigeaki Tagashira,
Satoshi Fujita:
The Power of Shortcuts in Greedy Routing in Content Addressable Networks.
EUC 2004: 994-1003 |
56 | EE | Hiroshi Osada,
Satoshi Fujita:
CHQ: A Multi-Agent Reinforcement Learning Scheme CHQ: A Multi-Agent Reinforcement Learning Scheme.
IAT 2004: 17-23 |
55 | EE | Daisuke Takemoto,
Shigeaki Tagashira,
Satoshi Fujita:
Distributed Algorithms for Balanced Zone Partitioning in Content-Addressable Networks.
ICPADS 2004: 377-384 |
54 | EE | Satoshi Fujita,
Toru Araki:
Three-Round Adaptive Diagnosis in Binary n-Cubes.
ISAAC 2004: 442-451 |
53 | EE | Satoshi Fujita,
Yue Liang:
How to Provide Continuous Services by Mobile Servers in Communication Networks.
PDCAT 2004: 337-340 |
52 | | Shigeaki Tagashira,
Syuhei Shirakawa,
Satoshi Fujita:
Proxy-Based Index Caching for Content-Addressable Networks.
PDPTA 2004: 1154-1160 |
51 | | Satoshi Fujita,
Shin'ichiro Umezane:
An Improved Heuristic for Solving TSP Based on the Evolution of Easy Instances.
PDPTA 2004: 324-330 |
50 | | Satoshi Fujita:
Optimal neighborhood broadcast in star graphs.
Parallel and Distributed Computing and Networks 2004: 588-593 |
49 | | Satoshi Fujita,
Shigeaki Tagashira:
Dynamic maintenance of candidate routes in localized QoS routing protocols.
Parallel and Distributed Computing and Networks 2004: 594-600 |
48 | EE | Masaya Mito,
Satoshi Fujita:
On Heuristics for Solving Winner Determination Problem in Combinatorial Auctions.
J. Heuristics 10(5): 507-523 (2004) |
2003 |
47 | EE | Satoshi Fujita,
Masayuki Masukawa,
Shigeaki Tagashira:
Recursive Refinement of Lower Bounds in the Multiprocessor Scheduling Problem.
Euro-Par 2003: 201-205 |
46 | EE | Masaya Mito,
Satoshi Fujita:
On Heuristics for Solving Winner Determination Problem in Combinatorial Auctions.
IAT 2003: 25-31 |
45 | EE | Satoshi Fujita,
Masayuki Masukawa,
Shigeaki Tagashira:
A Fast Branch-and-Bound Scheme for the Multiprocessor Scheduling Problem with Communication Time.
ICPP Workshops 2003: 104- |
44 | EE | Satoshi Fujita,
Shigeaki Tagashira:
Distributed Location of Shared Resources and Its Application to the Load Sharing Problem in Heterogeneous Distributed Systems.
ISHPC 2003: 393-401 |
43 | EE | Satoshi Fujita,
Arthur M. Farley:
Sparse Hypercube - Minimal k-line Broadcast Graph.
Discrete Applied Mathematics 127(3): 431-446 (2003) |
42 | EE | Satoshi Fujita:
On-line grid-packing with a single active grid.
Inf. Process. Lett. 85(4): 199-204 (2003) |
41 | EE | Satoshi Fujita:
Optimal Neighborhood Broadcast in Star Graphs.
Journal of Interconnection Networks 4(4): 419-428 (2003) |
2002 |
40 | EE | Satoshi Fujita:
On-Line Grid-Packing with a Single Active Grid.
COCOON 2002: 476-483 |
39 | EE | Satoshi Fujita:
A Semi-dynamic Multiprocessor Scheduling Algorithm with an Asymptotically Optimal Competitive Ratio.
Euro-Par 2002: 240-247 |
38 | EE | Satoshi Fujita,
Shigeaki Tagashira:
A Fast Barrier Synchronization Protocol for Broadcast Networks Based on a Dynamic Access Control (Research Note).
Euro-Par 2002: 795-798 |
37 | EE | Satoshi Fujita,
Masayuki Masukawa,
Shigeaki Tagashira:
A Fast Branch-and-Bound Algorithm with an Improved Lower Bound for Solving the Multiprocessor Scheduling Problem.
ICPADS 2002: 611-616 |
36 | EE | Satoshi Fujita:
Worst Case Analysis of a Greedy Multicast Algorithm in k-ary n-cubes.
ICPP 2002: 511-518 |
35 | | Satoshi Fujita,
Takeshi Hada:
Two-dimensional on-line bin packing problem with rotatable items.
Theor. Comput. Sci. 289(2): 939-952 (2002) |
2001 |
34 | | Satoshi Fujita,
Lei Deng,
Shigeaki Tagashira:
An Active Scheduler: Autonomous Concurrency Control of Parallel Programs in a Distributed Environment.
ICPADS 2001: 415-422 |
33 | | Satoshi Fujita:
Log-Time Multicast to Local Vertices in the Star Graph.
IPDPS 2001: 54 |
2000 |
32 | EE | Satoshi Fujita,
Takeshi Hada:
Two-Dimensional On-Line Bin Packing Problem with Rotatable Items.
COCOON 2000: 210-220 |
31 | EE | Satoshi Fujita,
Yuji Kashima:
Decentralized Load Balancing in Multi-node Broadcast Schemes for Hypercubes.
ISHPC 2000: 243-251 |
30 | EE | Satoshi Fujita,
Hui Zhou:
Multiprocessor Scheduling Problem with Probabilistic Execution Costs.
ISPAN 2000: 121-126 |
29 | EE | Satoshi Fujita:
Neighborhood Information Dissemination in the Star Graph.
IEEE Trans. Computers 49(12): 1366-1370 (2000) |
28 | EE | Satoshi Fujita,
Masafumi Yamashita,
Tiko Kameda:
A Study on r-Configurations - A Resource Assignment Problem on Graphs.
SIAM J. Discrete Math. 13(2): 227-254 (2000) |
1999 |
27 | EE | Satoshi Fujita,
Tadanori Nakagawa:
Lower Bounding Techniques for the Multiprocessor Scheduling Problem with Communication Delay.
IEEE PACT 1999: 212-220 |
26 | EE | Satoshi Fujita,
Arthur M. Farley:
Sparse Hypercube: A Minimal k-Line Broadcast Graph.
IPPS/SPDP 1999: 320-324 |
25 | | Satoshi Fujita:
A Fault-Tolerant Broadcast Scheme in the Star Graph under the Single-Port, Half-Duplex Communication Model.
IEEE Trans. Computers 48(10): 1123-1126 (1999) |
1998 |
24 | | Satoshi Fujita:
Neighbourhood Information Dissemination in the Star Graph.
SIROCCO 1998: 158-172 |
23 | | Yuichi Asahiro,
Hajime Asama,
Satoshi Fujita,
Ichiro Suzuki,
Masafumi Yamashita:
Distributed Algorithms for Carrying a Ladder by Omnidirectional Robots in Near Optimal Time.
Sensor Based Intelligent Robots 1998: 240-254 |
22 | EE | Satoshi Fujita:
A Quorum Based k-Mutual Exclusion by Weighted k-Quorum Systems.
Inf. Process. Lett. 67(4): 191-197 (1998) |
21 | | Satoshi Fujita,
Stephane Perennes,
Joseph G. Peters:
Neighbourhood Gossiping in Hypercubes.
Parallel Processing Letters 8(2): 189-195 (1998) |
1997 |
20 | | Satoshi Fujita:
A Fault Tolerant Broadcast Scheme in Star Graphs.
ASIAN 1997: 312-320 |
19 | EE | Yoshiyuki Hayakawa,
Satoshi Fujita,
Masafumi Yamashita:
A Decentralized Scheme for Multi-Node Broadcasting on Hypercubes.
ISPAN 1997: 487-493 |
18 | EE | Satoshi Fujita,
Arthur M. Farley:
Minimum-cost Line Broadcast in Paths.
Discrete Applied Mathematics 75(3): 255-268 (1997) |
1996 |
17 | | Satoshi Fujita,
Christian Laforest,
Stephane Perennes:
A Gossip Algorithm for Bus Networks with Buses of Limited Length.
Euro-Par, Vol. I 1996: 353-360 |
16 | | Satoshi Fujita,
Masafumi Yamashita:
Maintaining a Dynamic Set of Processors in a Distributed System.
WDAG 1996: 220-233 |
15 | | Satoshi Fujita,
Masafumi Yamashita:
Fast Gossiping on Mesh-Bus Computers.
IEEE Trans. Computers 45(11): 1326-1330 (1996) |
14 | | Satoshi Fujita,
Masafumi Yamashita:
A Nonoblivious Bus Access Scheme Yields an Optimal Partial Sorting Algorithm.
J. Parallel Distrib. Comput. 34(1): 111-116 (1996) |
13 | | Satoshi Fujita,
Masafumi Yamashita:
Optimal Group Gossiping in Hypercubes under a Circuit-Switching Model.
SIAM J. Comput. 25(5): 1045-1060 (1996) |
1995 |
12 | | Satoshi Fujita,
Tiko Kameda,
Masafumi Yamashita:
A Resource Assignment Problem on Graphs.
ISAAC 1995: 418-427 |
11 | EE | Satoshi Fujita:
A Note on the Size of a Multicast Tree in Hypercubes.
Inf. Process. Lett. 54(4): 223-227 (1995) |
1994 |
10 | | Hirotsugu Kakugawa,
Satoshi Fujita,
Masafumi Yamashita,
Tadashi Ae:
A Distributed k-Mutual Exclusion Algorithm Using k-Coterie.
Inf. Process. Lett. 49(4): 213-218 (1994) |
1993 |
9 | | Satoshi Fujita,
Masafumi Yamashita,
Tadashi Ae:
Optimal Group Gossiping in Hypercubes Under Wormhole Routing Model.
ISAAC 1993: 277-286 |
8 | | Hirotsugu Kakugawa,
Satoshi Fujita,
Masafumi Yamashita,
Tadashi Ae:
Availability of k-Coterie.
IEEE Trans. Computers 42(5): 553-558 (1993) |
7 | | Satoshi Fujita,
Masafumi Yamashita:
Fast Gossiping on Square Mesh Computers.
Inf. Process. Lett. 48(3): 127-130 (1993) |
6 | | Satoshi Fujita,
Masafumi Yamashita:
Optimal Gossiping in Mesh-Bus Computers.
Parallel Processing Letters 3: 357-361 (1993) |
1991 |
5 | | Satoshi Fujita,
Masafumi Yamashita,
Tadashi Ae:
Distributed k-Mutual Exclusion Problem and k-Coteries.
ISA 1991: 22-31 |
4 | | Satoshi Fujita,
Masafumi Yamashita,
Tadashi Ae:
Search Level Parallel Processing of Production Systems.
PARLE (2) 1991: 471-488 |
1989 |
3 | | Satoshi Fujita,
Reiji Aibara,
Masafumi Yamashita,
Tadashi Ae:
A Parallel Processing Architecture for Real-Time Production Systems with Truth Maintenance.
IWDM 1989: 331-344 |
1987 |
2 | | Satoshi Fujita,
Reiji Aibara,
Masafumi Yamashita,
Tadashi Ae:
A Template Matching Algorithm Using Optically-Connected 3-D VLSI Architecture.
ISCA 1987: 64-70 |
1 | | Satoshi Fujita,
Reiji Aibara,
Tadashi Ae:
A Real-Time Production System Architecture Using 3-D VLSI Technology.
IWDM 1987: 532-543 |